Termination of Term Rewriting by Interpretation

We investigate how to prove termination of term rewriting systems by interpretation of terms. This can be considered as a generalization of polynomial interpretations. A classification of types of termination is proposed built on properties in the semantic level. A transformation on term rewriting systems eliminating distributive rules is introduced. Using this distribution elimination a new termination proof of SUBST from [10] is given.

[1]  Isabelle Gnaedig,et al.  Proving Termination of Associative Commutative Rewriting Systems by Rewriting , 1986, CADE.

[2]  Clemens Lautemann.  A note on polynomial interpretation , 1988, Bull. EATCS.

[3]  J. Kruskal.  Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[4]  Joachim Steinbach,et al.  Extensions and Comparison of Simplification Orderings , 1989, RTA.

[5]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[6]  Dieter Hofbauer,et al.  Termination Proofs and the Length of Derivations (Preliminary Version) , 1989, RTA.

[7]  Dieter Hofbauer.  Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths , 1992, Theor. Comput. Sci..

[8]  Pierre Lescanne,et al.  Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation , 1987, Sci. Comput. Program..

[9]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[10]  Max Dauchet.  Simulation of Turning Machines by a Left-Linear Rewrite Rule , 1989, RTA.

[11]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[12]  Thérèse Hardin,et al.  Proof of termination of the rewriting system subst on CCL , 1986, Theor. Comput. Sci..

[13]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[14]  Yoshihito Toyama,et al.  Counterexamples to Termination for the Direct Sum of Term Rewriting Systems , 1987, Inf. Process. Lett..

[15]  Azuma Ohuchi,et al.  30周年記念論文 佳作：Modularity of Simple Termination of Term Rewriting Systems , 1990 .

[16]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[17]  Michaël Rusinowitch,et al.  On Termination of the Direct Sum of Term-Rewriting Systems , 1987, Inf. Process. Lett..

[18]  Pierre Lescanne.  Termination of Rewrite Systems by Elementary Interpretations , 1992, ALP.

[19]  Gérard Huet,et al.  On the Uniform Halting Problem for Term Rewriting Systems , 1978 .

[20]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[21]  Martín Abadi,et al.  Explicit substitutions , 1989, POPL '90.

[22]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.