Comtes — An experimental environment for the completion of term rewriting systems
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Critical pair criteria for completionJournal of Symbolic Computation, 1988
- Only prime superpositions need be considered in the Knuth-Bendix completion procedureJournal of Symbolic Computation, 1988
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Topologische NoltisetordrungenPublished by Springer Nature ,1986
- Effiziente Reduktionsstrategien in TermersetzungssystemenPublished by Springer Nature ,1986
- Reductions in tree replacement systemsTheoretical Computer Science, 1985
- A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithmACM SIGSAM Bulletin, 1983
- A note on leftmost innermost term reductionACM SIGSAM Bulletin, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Some reduction strategies for algebraic term rewritingACM SIGSAM Bulletin, 1982