Natural termination

Nachum Dershowitz*, Charles Hoot

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Two techniques are examined for showing termination of rewrite systems when simplification orderings are insufficient. The first approach generalizes the various path orderings and the conditions under which they work. Examples of its use are given and a brief description of an implementation is presented. The second approach uses restricted derivations, called "forward closures", for proving termination of orthogonal and overlaying systems. Both approaches allow the use of "natural" interpretations under which rules rewrite terms to terms of the same value.

Original languageEnglish
Pages (from-to)179-207
Number of pages29
JournalTheoretical Computer Science
Issue number2
StatePublished - 15 May 1995
Externally publishedYes


Dive into the research topics of 'Natural termination'. Together they form a unique fingerprint.

Cite this