Advanced Topics in Term Rewriting

Unlike current survey articles and textbooks, here the so-called confluence and termination hierarchies play a key role. Throughout, the relationships between the properties in the hierarchies are reviewed, and it is shown that for every implication X = Y in the hierarchies, the property X is undecidable for all term rewriting systems satisfying Y. Topics covered include: the newest techniques for proving termination of rewrite systems; a comprehensive chapter on conditional term rewriting systems; a state-of-the-art survey of modularity in term rewriting, and a uniform framework for term and graph rewriting, as well as the first result on conditional graph rewriting.

[1]  M. Schönfinkel.  Über die Bausteine der mathematischen Logik , 1924 .

[2]  A. Church.  The calculi of lambda-conversion , 1941 .

[3]  M. Newman.  On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

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

[5]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[6]  Tree-Manipulating Systems and Church-Rosser Theorems , 1973, JACM.

[7]  J. Roger Hindley,et al.  An abstract Church-Rosser theorem. II: Applications , 1974, Journal of Symbolic Logic.

[8]  Michael J. O'Donnell,et al.  Computing in systems described by equations , 1977, Lecture Notes in Computer Science.

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

[10]  Nachum Dershowitz,et al.  A Note on Simplification Orderings , 1979, Inf. Process. Lett..

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

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

[13]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[14]  Jean-Claude Raoult,et al.  Operational and Semantic Equivalence Between Recursive Programs , 1980, JACM.

[15]  John Staples,et al.  Computation on Graph-Like Expressions , 1980, Theor. Comput. Sci..

[16]  Nachum Dershowitz.  Termination of Linear Rewriting Systems (Preliminary Version) , 1981, ICALP.

[17]  Jean-Pierre Jouannaud,et al.  Termination of a Set of Rules Modulo a Set of Equations , 1984, CADE.

[18]  Jan A. Bergstra,et al.  On Specifying Sets of Integers , 1984, J. Inf. Process. Cybern..

[19]  Jan Maluszynski,et al.  AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs , 1985, SLP.

[20]  David A. Plaisted,et al.  The Undecidability of Self-Embedding for Term Rewriting Systems , 1985, Inf. Process. Lett..

[21]  Paliath Narendran,et al.  On Recursive Path Ordering , 1985, Theor. Comput. Sci..

[22]  H. Ehrig,et al.  Equational Specifications and Algebras , 1985 .

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

[24]  Corrado Moiso,et al.  Notes on the Elimination of Conditions , 1987, CTRS.

[25]  Jean-Pierre Jouannaud,et al.  Reductive conditional term rewriting systems , 1987, Formal Description of Programming Concepts.

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

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

[28]  Stéphane Kaplan,et al.  Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence , 1987, J. Symb. Comput..

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

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

[31]  Yoshihito Toyama,et al.  On the Church-Rosser property for the direct sum of term rewriting systems , 1984, JACM.

[32]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[33]  Nachum Dershowitz,et al.  Canonical Conditional Rewrite Systems , 1988, CADE.

[34]  Matthias Jantzen,et al.  Confluent String Rewriting , 1988, EATCS Monographs on Theoretical Computer Science.

[35]  Laurence Puel,et al.  Using Unavoidable Set of Trees to Generalize Kruskal's Theorem , 1989, J. Symb. Comput..

[36]  Aart Middeldorp,et al.  A sufficient condition for the termination of the direct sum of term rewriting systems , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[37]  Nachum Dershowitz,et al.  A Rationale for Conditional Equational Programming , 1990, Theor. Comput. Sci..

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

[39]  Yoshihito Toyama,et al.  Completeness of Combinations of Constructor Systems , 1991, RTA.

[40]  Harald Ganzinger,et al.  Order-Sorted Completion: The Many-Sorted Way , 1991, Theor. Comput. Sci..

[41]  H. Zantema.  Classifying termination of term rewriting , 1991 .

[42]  Jean H. Gallier,et al.  What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory , 1991, Ann. Pure Appl. Log..

[43]  Alejandro Ríos,et al.  Strong Normalization of Substitutions , 1992, MFCS.

[44]  Max Dauchet,et al.  Simulation of Turing Machines by a Regular Rewrite Rule , 1992, Theor. Comput. Sci..

[45]  Jaco van de Pol,et al.  Modularity in many-sorted term rewriting systems , 1992 .

[46]  Enno Ohlebusch,et al.  Combinations of Simplifying Conditional Term Rewriting Systems , 1992, CTRS.

[47]  Bernhard Gramlich.  Generalized Sufficient Conditions for Modular Termination of Rewriting , 1992, ALP.

[48]  Detlef Plump,et al.  Collapsed Tree Rewriting: Completeness, Confluence, and Modularity , 1992, CTRS.

[49]  E. Ohlebusch,et al.  A Note on Simple Termination of Infinite Term Rewriting Systems , 1992 .

[50]  Dino Pedreschi,et al.  Modular termination proofs for logic and pure PROLOG programs , 1993 .

[51]  Sandro Etalle,et al.  On the Unification Free Prolog Programs , 1993, MFCS.

[52]  J. Avenhaus,et al.  Canonical Conditional Rewrite Systems Containing Extra Variables , 1993 .

[53]  D. Plaisted.  Equational reasoning and term rewriting systems , 1993 .

[54]  J. R. Kennaway,et al.  The adequacy of term graph rewriting for simulating term rewriting , 1993 .

[55]  Aart Middeldorp,et al.  Modular Properties of Conditional Term Rewriting Systems , 1993, Inf. Comput..

[56]  Danny De Schreye,et al.  Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..

[57]  E. Ohlebusch.  On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems , 1994, CAAP.

[58]  Michael Hanus,et al.  The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..

[59]  Christian Prehofer,et al.  On Modularity in Term Rewriting and Narrowing , 1994, CCL.

[60]  Christoph Walther,et al.  On Proving the Termination of Algorithms by Machine , 1994, Artif. Intell..

[61]  Hans Zantema,et al.  Termination of logic programs via labelled term rewrite systems , 1994 .

[62]  Hans Zantema,et al.  Termination of Term Rewriting: Interpretation and Type Elimination , 1994, J. Symb. Comput..

[63]  Enno Ohlebusch,et al.  Modular Properties of Composable Term Rewriting Systems , 1995, J. Symb. Comput..

[64]  Vincent van Oostrom,et al.  Confluence by Decreasing Diagrams , 1994, Theor. Comput. Sci..

[65]  Rachid Echahed,et al.  A needed narrowing strategy , 2000, JACM.

[66]  Pierre Lescanne,et al.  On Termination of One Rule Rewrite Systems , 1994, Theor. Comput. Sci..

[67]  Hans Zantema,et al.  Syntactical Analysis of Total Termination , 1994, ALP.

[68]  Enno Ohlebusch,et al.  On the Modularity of Termination of Term Rewriting Systems , 1994, Theor. Comput. Sci..

[69]  Yoshihito Toyama,et al.  Modularity of Confluence: A Simplified Proof , 1994, Inf. Process. Lett..

[70]  M. R. K. Krishna Rao.  Simple Termination of Hierarchical Combinations of Term Rewriting Systems , 1994, TACS.

[71]  Azuma Ohuchi,et al.  Decomposable Termination of Composable Term Rewriting Systems , 1995, IEICE Trans. Inf. Syst..

[72]  Hans Zantema,et al.  Termination of Term Rewriting by Semantic Labelling , 1995, Fundam. Informaticae.

[73]  M.R.K. Kr ishna Rao,et al.  Modular Proofs for Completeness of Hierarchical Term Rewriting Systems , 1995, Theor. Comput. Sci..

[74]  Azuma Ohuchi,et al.  Modularity in Noncopying Term Rewriting , 1995, Theor. Comput. Sci..

[75]  Enno Ohlebusch.  Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems , 1995, Inf. Process. Lett..

[76]  Nachum Dershowitz,et al.  Natural Termination , 1995, Theor. Comput. Sci..

[77]  J. Urgen Giesl.  Generating Polynomial Orderings for Termination Proofs ? , 1995 .

[78]  Jürgen Giesl,et al.  Termination Analysis for Functional Programs using Term Orderings , 1995, SAS.

[79]  Bernhard Gramlich,et al.  Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems , 1995, Fundam. Informaticae.

[80]  Massimo Marchiori,et al.  Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems , 1995, Theor. Comput. Sci..

[81]  Hans Zantema,et al.  Total Termination of Term Rewriting is Undecidable , 1995, J. Symb. Comput..

[82]  Enno Ohlebusch,et al.  Relative Undecidability in Term Rewriting: I. The Termination Hierarchy , 1996, Inf. Comput..

[83]  Bernhard Gramlich,et al.  On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems , 1996, Theor. Comput. Sci..

[84]  Claude Marché,et al.  CiME: Completion Modulo E , 1996, RTA.

[85]  Zena M. Ariola,et al.  Equational Term Graph Rewriting , 1996, Fundam. Informaticae.

[86]  Massimo Marchiori,et al.  Unravelings and Ultra-properties , 1996, ALP.

[87]  Bernhard Gramlich,et al.  Termination and confluence: properties of structured rewrite systems , 1996 .

[88]  Massimo Marchiori.  On the Expressive Power of Rewriting , 1997, FSTTCS.

[89]  Aart Middeldorp,et al.  Type introduction for equational rewriting , 1997, Acta Informatica.

[90]  Femke van Raamsdonk.  Translating Logic Programs into Conditional Rewriting Systems , 1997, ICLP.

[91]  Alfons Geser,et al.  Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems , 1997, J. Symb. Comput..

[92]  Yehoshua Sagiv,et al.  Automatic Termination Analysis of Logic Programs (with Detailed Experimental Results) , 1997 .

[93]  Yoshihito Toyama,et al.  Persistency of Confluence , 1997, J. Univers. Comput. Sci..

[94]  Nachum Dershowitz.  Innocuous Constructor-Sharing Combinations , 1997, RTA.

[95]  Yoshihito Toyama,et al.  On Composable Properties of Term Rewriting Systems , 1997, ALP/HOA.

[96]  Massimo Marchiori,et al.  On Deterministic Conditional Rewriting , 1997 .

[97]  Deepak Kapur,et al.  Transformational Methodology for Proving Termination of Logic Programs , 1998, J. Log. Program..

[98]  Enno Ohlebusch,et al.  Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof , 1998, Bull. EATCS.

[99]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[100]  Danny De Schreye,et al.  Constraint-based termination analysis of logic programs , 1999, TOPL.

[101]  Yoshihito Toyama,et al.  Argument Filtering Transformation , 1999, PPDP.

[102]  Michael Codish,et al.  A Semantic Basis for the Termination Analysis of Logic Programs , 1999, J. Log. Program..

[103]  Thomas Arts.  System Description: The Dependency Pair Method , 2000, RTA.

[104]  Alfons Geser.  On normalizing, non-terminating one-rule string rewriting systems , 2000, Theor. Comput. Sci..

[105]  Zena M. Ariola,et al.  Bisimilarity in Term Graph Rewriting , 2000, Inf. Comput..

[106]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[107]  T. Arts.  Automatically proving termination and innermost normalisation of term rewriting systems , 2001 .

[108]  Toshiyuki Yamada,et al.  Confluence and Termination of Simply Typed Term Rewriting Systems , 2001, RTA.

[109]  Enno Ohlebusch,et al.  Implementing conditional term rewriting by graph rewriting , 2001, Theor. Comput. Sci..

[110]  Jürgen Giesl,et al.  Verification of Erlang Processes by Dependency Pairs , 2001, Applicable Algebra in Engineering, Communication and Computing.

[111]  Takashi Nagaya,et al.  Decidability for Left-Linear Growing Term Rewriting Systems , 1998, Inf. Comput..

[112]  Enno Ohlebusch,et al.  Modular Termination Proofs for Rewriting Using Dependency Pairs , 2002, J. Symb. Comput..

[113]  Alfons Geser.  Relative Undecidability in Term Rewriting Part 2 : The Confluence Hierarchy , 2002 .

[114]  Hoon Hong,et al.  Testing Positiveness of Polynomials , 1998, Journal of Automated Reasoning.