Termination of term rewriting by interpretation
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 155-167
- https://doi.org/10.1007/3-540-56393-8_12
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Explicit substitutionsJournal of Functional Programming, 1991
- Rewrite SystemsPublished by Elsevier ,1990
- Termination proofs by multiset path orderings imply primitive recursive derivation lengthsPublished by Springer Nature ,1990
- Extensions and comparison of simplification orderingsPublished by Springer Nature ,1989
- Simulation of Turing machines by a left-linear rewrite rulePublished by Springer Nature ,1989
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Proof of termination of the rewriting system subst on CCLTheoretical Computer Science, 1986
- Proving termination of associative commutative rewriting systems by rewritingPublished by Springer Nature ,1986
- Proving termination with multiset orderingsCommunications of the ACM, 1979