Hyperedge Replacement Jungle Rewriting for Term-Rewriting Systems and Programming

Abstract We introduce hyperedge replacement jungle rewriting, a graph-rewriting formalism suitable for modeling the manipulation of terms and similar structures, and investigate its expressive power by showing that it can model both term-rewriting systems and logic programming in a faithful way. For term-rewriting systems we prove the soundness of their jungle representation, and a result of completeness w.r.t. applicability which is stronger than similar results in the related literature, since it works also for non-left-linear rules. For logic programming both soundness and completeness hold.

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

[2]  Michael Löwe,et al.  Extended algebraic graph transformation , 1991 .

[3]  Rod M. Burstall,et al.  A Categorical Unification Algorithm , 1985, CTCS.

[4]  Bruno Courcelle,et al.  Recursive Queries and Context-free Graph Grammars , 1991, Theor. Comput. Sci..

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

[6]  Andrea Asperti,et al.  Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs , 1989, ICLP.

[7]  Richard Kennaway,et al.  Graph Rewriting in Some Categories of Partial Morphisms , 1990, Graph-Grammars and Their Application to Computer Science.

[8]  Joseph A. Goguen,et al.  What Is Unification?: A Categorical View of Substitution, Equation and Solution , 1989 .

[9]  Hartmut Ehrig,et al.  Graph Grammars and Logic Programming , 1990, Graph-Grammars and Their Application to Computer Science.

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

[11]  Hans-Jörg Kreowski,et al.  Is parallelism already concurrency? Part 1: Derivations in graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[12]  Hartmut Ehrig,et al.  Graph rewriting with unification and composition , 1986, Graph-Grammars and Their Application to Computer Science.

[13]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[14]  Hartmut Ehrig,et al.  From Graph Grammars to High Level Replacement Systems , 1990, Graph-Grammars and Their Application to Computer Science.

[15]  Hartmut Ehrig.  Aspects of concurrency in graph grammars , 1982, Graph-Grammars and Their Application to Computer Science.

[16]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[17]  Francesca Rossi,et al.  Logic Programming as Hypergraph Rewriting , 1991, TAPSOFT, Vol.1.

[18]  Annegret Habel,et al.  Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

[19]  Richard Kennaway.  On "On Graph Rewritings" , 1987, Theor. Comput. Sci..

[20]  Annegret Habel,et al.  May we introduce to you: hyperedge replacement , 1986, Graph-Grammars and Their Application to Computer Science.

[21]  Hartmut Ehrig,et al.  Tutorial introduction to the algebraic approach of graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.