Termination of rewriting

Nachum Dershowitz

doi:10.1016/S0747-7171(87)80022-6

Termination of rewriting

Nachum Dershowitz^*

^*Corresponding author for this work

University of Illinois at Urbana-Champaign

Research output: Contribution to journal › Article › peer-review

522 Scopus citations

Abstract

This survey describes methods for proving that systems of rewrite rules are terminating programs. We illustrate the use in termination proofs of various kinds of orderings on terms, including polynomial interpretations and path orderings. The effect of restrictions, such as linearity, on the form of rules is also considered. In general, however, termination is an undecidable property of rewrite systems.

Original language	English
Pages (from-to)	69-115
Number of pages	47
Journal	Journal of Symbolic Computation
Volume	3
Issue number	1-2
DOIs	https://doi.org/10.1016/S0747-7171(87)80022-6
State	Published - 1987
Externally published	Yes

Access to Document

10.1016/S0747-7171(87)80022-6

Cite this

@article{093280f2e74c44eaaddef1feb0a8478f,

title = "Termination of rewriting",

abstract = "This survey describes methods for proving that systems of rewrite rules are terminating programs. We illustrate the use in termination proofs of various kinds of orderings on terms, including polynomial interpretations and path orderings. The effect of restrictions, such as linearity, on the form of rules is also considered. In general, however, termination is an undecidable property of rewrite systems.",

author = "Nachum Dershowitz",

year = "1987",

doi = "10.1016/S0747-7171(87)80022-6",

language = "אנגלית",

volume = "3",

pages = "69--115",

journal = "Journal of Symbolic Computation",

issn = "0747-7171",

publisher = "Academic Press",

number = "1-2",

}

TY - JOUR

T1 - Termination of rewriting

AU - Dershowitz, Nachum

PY - 1987

Y1 - 1987

N2 - This survey describes methods for proving that systems of rewrite rules are terminating programs. We illustrate the use in termination proofs of various kinds of orderings on terms, including polynomial interpretations and path orderings. The effect of restrictions, such as linearity, on the form of rules is also considered. In general, however, termination is an undecidable property of rewrite systems.

AB - This survey describes methods for proving that systems of rewrite rules are terminating programs. We illustrate the use in termination proofs of various kinds of orderings on terms, including polynomial interpretations and path orderings. The effect of restrictions, such as linearity, on the form of rules is also considered. In general, however, termination is an undecidable property of rewrite systems.

UR - https://www.scopus.com/pages/publications/84910829499

U2 - 10.1016/S0747-7171(87)80022-6

DO - 10.1016/S0747-7171(87)80022-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84910829499

SN - 0747-7171

VL - 3

SP - 69

EP - 115

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

IS - 1-2

ER -

Termination of rewriting

Abstract

Access to Document

Other files and links

Fingerprint

Cite this