Orderings for term-rewriting systems

Nachum Dershowitz*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of "simplification orderings", orderings in which any term that is homeomorphically embeddable in another is smaller than the other. A particularly useful class of simplification orderings, the "recursive path orderings", is defined. Several examples of the use of such orderings in termination proofs are given.

Original languageEnglish
Article number4568008
Pages (from-to)123-131
Number of pages9
JournalProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
StatePublished - 1979
Externally publishedYes
Event20th Annual Symposium on Foundations of Computer Science, FOCS 1979 - San Juan, United States
Duration: 29 Oct 197931 Oct 1979

Cite this