Skip to main content
Conference Proceedings

Termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 202 LNCS 180-224
DOI: 10.1007/3-540-15976-2_9
41Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.

Cite

CITATION STYLE

APA

Dershowitz, N. (1985). Termination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 202 LNCS, pp. 180–224). Springer Verlag. https://doi.org/10.1007/3-540-15976-2_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free