Natural termination
- 15 May 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 142 (2) , 179-207
- https://doi.org/10.1016/0304-3975(94)00275-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Relating innermost, weak, uniform and modular termination of term rewriting systemsPublished by Springer Nature ,2005
- An Improved General Path OrderApplicable Algebra in Engineering, Communication and Computing, 1996
- Equational inference, canonical proofs, and proof orderingsJournal of the ACM, 1994
- On the recursive decomposition ordering with lexicographical status and other related orderingsJournal of Automated Reasoning, 1990
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969
- On Theories with a Combinatorial Definition of "Equivalence"Annals of Mathematics, 1942