Essentials of Term Graph Rewriting

Abstract Term graph rewriting is a model for computing with graphs representing functional expressions. Graphs allow to share common subexpressions which improves the efficiency of conventional term rewriting in space and time. This article reviews essentials of term graph rewriting concerning soundness, completeness, termination and confluence.

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

[2]  Detlef Plump,et al.  Simplification Orders for Term Graph Rewriting , 1997, MFCS.

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

[4]  Pierre Lescanne,et al.  Algebraic and Logic Programming , 1988, Lecture Notes in Computer Science.

[5]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[6]  Detlef Plump,et al.  Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems , 1990, CTRS.

[7]  Detlef Plump,et al.  Critical Pairs in Term Graph Rewriting , 1994, MFCS.

[8]  M. R. K. Krishna Rao,et al.  Modular Aspects of Term Graph Rewriting , 1998, Theor. Comput. Sci..

[9]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

[10]  Berthold Hoffmann,et al.  Implementing term rewriting by jungle evaluation , 1991, RAIRO Theor. Informatics Appl..

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

[12]  Detlef Plump,et al.  Evaluation of functional expressions by hypergraph rewriting , 1993 .

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

[14]  Annegret Habel,et al.  Jungle evaluation , 1988, Fundam. Informaticae.

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

[16]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[17]  Berthold Hoffmann,et al.  Jungle Evaluation for Efficient Term Rewriting , 1988, ALP.

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