Term Rewriting with Sharing and Memoïzation

Jungle evaluation is an approach to define term rewriting with sharing based on graph grammars. This approach preserves important properties of term rewriting like termination, and confluence for terminating systems (under mild restrictions).

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

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

[3]  Stefan Kahrs,et al.  Unlimp, Uniqueness as a Leitmotiv for Implementation , 1992, PLILP.

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

[5]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[6]  John Hughes,et al.  Lazy Memo-functions , 1985, FPCA.

[7]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[8]  Nachum Dershowitz,et al.  Rewrite, rewrite, rewrite, rewrite, rewrite... , 1989, POPL '89.

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

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

[11]  Nachum Dershowitz,et al.  Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . , 1991, Theor. Comput. Sci..

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