Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- 26 October 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 105 (1) , 129-140
- https://doi.org/10.1016/0304-3975(92)90289-r
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Path of subterms ordering and recursive decomposition ordering revisitedJournal of Symbolic Computation, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982