A 2-Categorical Presentation of Term Graph Rewriting

It is well-known that a term rewriting system can be faithfully described by a cartesian 2-category, where horizontal arrows represent terms, and cells represent rewriting sequences. In this paper we propose a similar, original 2-categorical presentation for term graph rewriting. Building on a result presented in [8], which shows that term graphs over a given signature are in one-to-one correspondence with arrows of a gs-monoidal category freely generated from the signature, we associate with a term graph rewriting system a gs-monoidal 2-category, and show that cells faithfully represent its rewriting sequences. We exploit the categorical framework to relate term graph rewriting and term rewriting, since gs-monoidal (2-)categories can be regarded as “weak” cartesian (2-) categories, where certain (2-)naturality axioms have been dropped.

[1]  Yves Lafont.  Equational Reasoning with Two-Dimensional Diagrams , 1993, Term Rewriting.

[2]  Fabio Gadducci,et al.  An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories , 1999, Appl. Categorical Struct..

[3]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[4]  Zoltán Ésik,et al.  Some varieties of iteration theories , 1984, Bull. EATCS.

[5]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[6]  Fabio Gadducci,et al.  Relating Two Categorial Models of Term Rewriting , 1995, RTA.

[7]  Andrea Corradini,et al.  Hyperedge Replacement Jungle Rewriting for Term-Rewriting Systems and Programming , 1993, Theor. Comput. Sci..

[8]  R. Street,et al.  Review of the elements of 2-categories , 1974 .

[9]  M. J. Plasmeijer,et al.  Term graph rewriting: theory and practice , 1993 .

[10]  Fabio Gadducci,et al.  On The Algebraic Approach To Concurrent Term Rewriting , 1996 .

[11]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

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

[13]  Jan Willem Klop,et al.  On the adequacy of graph rewriting for simulating term rewriting , 1994, TOPL.

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

[15]  Joseph A. Goguen,et al.  Some Fundamentals of Order-Algebraic Semantics , 1976, MFCS.

[16]  G Boudol.  Computational semantics of term rewriting systems , 1986 .

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

[18]  John Power.  An Abstract Formulation for Rewrite Systems , 1989, Category Theory and Computer Science.

[19]  Cosimo Laneve,et al.  Axiomatizing permutation equivalence , 1996, Mathematical Structures in Computer Science.

[20]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[21]  Bart Jacobs,et al.  Semantics of Weakening and Contraction , 1994, Ann. Pure Appl. Log..

[22]  David E. Rydeheard,et al.  Foundations of Equational Deduction: A Categorical Treatment of Equational Proofs and Unification Algorithms , 1987, Category Theory and Computer Science.

[23]  Jean-Jacques Lévy,et al.  Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[24]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[25]  Andrea Corradini,et al.  Concurrent Graph and Term Graph Rewriting , 1996, CONCUR.

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

[27]  Gonzalo E. Reyes,et al.  Doctrines in Categorical Logic , 1977 .

[28]  Marko C. J. D. van Eekelen,et al.  Functional Programming and Parallel Graph Rewriting , 1993 .