Proving termination of (conditional) rewrite systems
- 1 June 1993
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 30 (6) , 537-568
- https://doi.org/10.1007/bf01209624
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Transformation orderingPublished by Springer Nature ,1987
- How to choose the weights in the Knuth Bendix orderingPublished by Springer Nature ,1987
- An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretationsPublished by Springer Nature ,1986
- Commutation, transformation, and terminationPublished by Springer Nature ,1986
- A path ordering for proving termination of term rewriting systemsPublished by Springer Nature ,1985
- TerminationPublished by Springer Nature ,1985
- Path of subterms ordering and recursive decomposition ordering revisitedPublished by Springer Nature ,1985
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969