Termination of rewriting (Q1098624): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: RRL / rank | |||
Normal rank | |||
Revision as of 10:55, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Termination of rewriting |
scientific article |
Statements
Termination of rewriting (English)
0 references
1987
0 references
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.
0 references
term rewriting
0 references
survey
0 references
rewrite rules
0 references
termination proofs
0 references
orderings on terms
0 references
