Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 347-358
- https://doi.org/10.1007/3-540-53162-9_50
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Rewrite SystemsPublished by Elsevier ,1990
- Extensions and comparison of simplification orderingsPublished by Springer Nature ,1989
- Termination proofs and the length of derivationsPublished by Springer Nature ,1989
- Termination of rewritingJournal of Symbolic Computation, 1987
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982