Orderings for term-rewriting systems

Nachum Dershowitz

doi:10.1109/SFCS.1979.32

Orderings for term-rewriting systems

Nachum Dershowitz^*

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

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 simplification orderings, the "recursive path orderings", is defined. Several examples of the use of such orderings in termination proofs are given.

Original language	English
Article number	4568008
Pages (from-to)	123-131
Number of pages	9
Journal	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
DOIs	https://doi.org/10.1109/SFCS.1979.32
State	Published - 1979
Externally published	Yes
Event	20th Annual Symposium on Foundations of Computer Science, FOCS 1979 - San Juan, United States Duration: 29 Oct 1979 → 31 Oct 1979

Access to Document

10.1109/SFCS.1979.32

Cite this

@article{e71ed80a5e004440bfe6d43146a65515,

title = "Orderings for term-rewriting systems",

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 simplification orderings, the {"}recursive path orderings{"}, is defined. Several examples of the use of such orderings in termination proofs are given.",

author = "Nachum Dershowitz",

note = "Publisher Copyright: {\textcopyright} 1979 IEEE.; 20th Annual Symposium on Foundations of Computer Science, FOCS 1979 ; Conference date: 29-10-1979 Through 31-10-1979",

year = "1979",

doi = "10.1109/SFCS.1979.32",

language = "אנגלית",

pages = "123--131",

journal = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

issn = "0272-5428",

}

TY - JOUR

T1 - Orderings for term-rewriting systems

AU - Dershowitz, Nachum

PY - 1979

Y1 - 1979

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957642467&partnerID=8YFLogxK

U2 - 10.1109/SFCS.1979.32

DO - 10.1109/SFCS.1979.32

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:84957642467

SN - 0272-5428

SP - 123

EP - 131

JO - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

M1 - 4568008

T2 - 20th Annual Symposium on Foundations of Computer Science, FOCS 1979

Y2 - 29 October 1979 through 31 October 1979

ER -

Orderings for term-rewriting systems

Abstract

Access to Document

Other files and links

Cite this