Rewrite order

Rewriting s to t by a rule l::=r. If l and r are related by a rewrite relation, so are s and t. A simplification ordering always relates l and s, and similarly r and t.

In theoretical computer science, in particular in automated reasoning about formal equations, reduction orderings are used to prevent endless loops. Rewrite orders, and, in turn, rewrite relations, are generalizations of this concept that have turned out to be useful in theoretical investigations.

Motivation

Intuitively, a reduction order R relates two terms s and t if t is properly "simpler" than s in some sense.

For example, simplification of terms may be a part of a computer algebra program, and may be using the rule set { x+0 → x , 0+x → x , x*0 → 0, 0*x → 0, x*1 → x , 1*x → x }. In order to prove impossibility of endless loops when simplifying a term using these rules, the reduction order defined by "sRt if term t is properly shorter than term s" can be used; applying any rule from the set will always properly shorten the term.

In contrast, to establish termination of "distributing-out" using the rule x*(y+z) → x*y+x*z, a more elaborate reduction order will be needed, since this rule may blow up the term size due to duplication of x. The theory of rewrite orders aims at helping to provide an appropriate order in such cases.

Formal definitions

Formally, a binary relation (→) on the set of terms is called a rewrite relation if it is closed under contextual embedding and under instantiation; formally: if l→r implies u [ l σ]_p→u[rσ]_p for all terms l, r, u, each path p of u, and each substitution σ. If (→) is also irreflexive and transitive, then it is called a rewrite ordering, ^[1] or rewrite preorder . If the latter (→) is moreover well-founded, it is called a reduction ordering, ^[2] or a reduction preorder. Given a binary relation R, its rewrite closure is the smallest rewrite relation containing R. ^[3] A transitive and reflexive rewrite relation that contains the subterm ordering is called a simplification ordering. ^[4]

Overview of rewrite relations ^{[note 1]}

	rewrite relation	rewrite order	reduction order	simplification order
closed under context x R y implies u [ x]pRu[y]p	Yes	Yes	Yes	Yes
closed under instantiation x R y implies x σ Ryσ	Yes	Yes	Yes	Yes
contains subterm relation y subterm of x implies x R y				Yes
reflexive always x R x		(No)	(No)	Yes
irreflexive never x R x		Yes	Yes	(No)
transitive x R y and y R z implies x R z		Yes	Yes	Yes
well-founded no infinite chain x1Rx2Rx3R ... [note 2]			Yes	(Yes)

Properties

• The converse, the symmetric closure, the reflexive closure, and the transitive closure of a rewrite relation is again a rewrite relation, as are the union and the intersection of two rewrite relations. ^[1]
• The converse of a rewrite order is again a rewrite order.
• While rewrite orders exist that are total on the set of ground terms ("ground-total" for short), no rewrite order can be total on the set of all terms. ^{[note 3] [5]}
• A term rewriting system {l₁::=r₁,...,l_n::=r_n, ...} is terminating if its rules are a subset of a reduction ordering. ^{[note 4] [2]}
• Conversely, for every terminating term rewriting system, the transitive closure of (::=) is a reduction ordering, ^[2] which need not be extendable to a ground-total one, however. For example, the ground term rewriting system { f(a)::=f(b), g(b)::=g(a) } is terminating, but can be shown so using a reduction ordering only if the constants a and b are incomparable. ^{[note 5] [6]}
• A ground-total and well-founded rewrite ordering ^{[note 6]} necessarily contains the proper subterm relation on ground terms. ^{[note 7]}
• Conversely, a rewrite ordering that contains the subterm relation ^{[note 8]} is necessarily well-founded, when the set of function symbols is finite. ^{[5] [note 9]}
• A finite term rewriting system {l₁::=r₁,...,l_n::=r_n, ...} is terminating if its rules are subset of the strict part of a simplification ordering. ^{[4] [8]}

Notes

1. Parenthesized entries indicate inferred properties which are not part of the definition. For example, an irreflexive relation cannot be reflexive (on a nonempty domain set).
2. except all x_i are equal for all i beyond some n, for a reflexive relation
3. Since x<y implies y<x, since the latter is an instance of the former, for variables x, y.
4. i.e. if l_i > r_i for all i, where (>) is a reduction ordering; the system need not have finitely many rules
5. Since e.g. a>b implied g(a)>g(b), meaning the second rewrite rule was not decreasing.
6. i.e. a ground-total reduction ordering
7. Else, t|_p > t for some term t and position p, implying an infinite descending chain t > t[t]_p > t[t[t]_p]_p > ... ^{[6] [7]}
8. i.e. a simplification ordering
9. The proof of this property is based on Higman's lemma, or, more generally, Kruskal's tree theorem.

References

Nachum Dershowitz; Jean-Pierre Jouannaud (1990). "Rewrite Systems". In Jan van Leeuwen (ed.). Formal Models and Semantics. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 243–320. doi:10.1016/B978-0-444-88074-1.50011-1. ISBN   9780444880741.

1. Dershowitz, Jouannaud (1990), sect.2.1, p.251
2. Dershowitz, Jouannaud (1990), sect.5.1, p.270
3. Dershowitz, Jouannaud (1990), sect.2.2, p.252
4. Dershowitz, Jouannaud (1990), sect.5.2, p.274
5. Dershowitz, Jouannaud (1990), sect.5.1, p.272
6. Dershowitz, Jouannaud (1990), sect.5.1, p.271
7. David A. Plaisted (1978). A Recursively Defined Ordering for Proving Termination of Term Rewriting Systems (Technical report). Univ. of Illinois, Dept. of Comp. Sc. p. 52. R-78-943.
8. N. Dershowitz (1982). "Orderings for Term-Rewriting Systems" (PDF). Theoret. Comput. Sci. 17 (3): 279–301. doi:10.1016/0304-3975(82)90026-3. S2CID   6070052. Here: p.287; the notions are named slightly different.