Abstract
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 simplication orderings, the ″recursive path orderings″ , is defined. Several examples of the use of such orderings in termination proofs are given.
| Original language | English |
|---|---|
| Pages (from-to) | 123-131 |
| Number of pages | 9 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - 1979 |
| Event | Annu Symp Found Comput Sci Proc 20th - San Juan Bautista, PR Duration: 29 Oct 1979 → 31 Oct 1979 |