Orderings for term-rewriting systems

  • Nachum Dershowitz
  • Published 1979 in
    20th Annual Symposium on Foundations of Computer…


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… (More)
DOI: 10.1109/SFCS.1979.32