Sergey Baranov, Bertrand Boisvert, Louis Feraud & Sergei Soloviev (2011):
Typed Lambda Terms in Categorical Graph Rewriting.
In: N.N. Vassiliev: The International Conference Polynomial Computer Algebra, April 18-22-2011, Saint-Petersburg, Russia, Euler International Mathematical Institute.
VVM Publishing,
pp. 9–16.
David Chemouil (2005):
Isomorphisms of simple inductive types through extensional rewriting.
Math. Structures in Computer Science 15(5),
doi:10.1017/S0960129505004950.
David Chemouil & Sergei Soloviev (2003):
Remarks on isomorphisms of simple inductive types.
In: Mathematics, Logic and Computation , Eindhoven, 04/07/03-05/07/03.
Elsevier,
ENTCS 85, 7,
pp. 1–19,
doi:10.1016/S1571-0661(04)80760-6.
Andrea Corradini, Hartmut Ehrig, Hans-Jörg Kreowski & Grzegorz Rozenberg (2002):
Graph Transformation, First International Conference, ICGT 2002, Barcelona, Spain, October 7-12, 2002, Proceedings.
LNCS 2505.
Springer.
H. Ehrig, K. Ehrig, U. Prange & G. Taentzer (2006):
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series).
Springer-Verlag New York, Inc.,
Secaucus, NJ, USA.
Hartmut Ehrig (1978):
Introduction to the Algebraic Theory of Graph Grammars (A Survey).
In: Graph-Grammars and Their Application to Computer Science and Biology,
pp. 1–69.
Hartmut Ehrig, Gregor Engels, Francesco Parisi-Presicce & Grzegorz Rozenberg (2004):
Graph Transformations, Second International Conference, ICGT 2004, Rome, Italy, September 28 - October 2, 2004, Proceedings.
LNCS 3256.
Springer,
doi:10.1007/b100934.
Hartmut Ehrig, Julia Padberg, Ulrike Prange & Annegret Habel (2006):
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation.
Fundam. Inf. 74(1),
pp. 1–29.
Hartmut Ehrig, Ulrike Prange & Gabriele Taentzer (2004):
Fundamental Theory for Typed Attributed Graph Transformation.
In: editor = "Ehrig",,
pp. 161–177,
doi:10.1007/978-3-540-30203-2_13.
Annegret Habel, Reiko Heckel & Gabriele Taentzer (1996):
Graph Grammars with Negative Application Conditions..
Fundam. Inform. 26(3/4),
pp. 287–313.
Michael Löwe (1993):
Algebraic approach to single-pushout graph transformation.
Theor. Comput. Sci. 109,
pp. 181–224,
doi:10.1016/0304-3975(93)90068-5.
Fernando Orejas (2011):
Symbolic graphs for attributed graph constraints.
J. Symb. Comput. 46,
pp. 294–315,
doi:10.1016/j.jsc.2010.09.009.
Maxime Rebout (2008):
Une approche catégorique unifiée pour la récriture de graphes attribués.
Université Paul Sabatier.
Maxime Rebout, Louis Féraud, Lionel Marie-Magdeleine & Sergei Soloviev (2009):
Computations in Graph Rewriting: Inductive types and Pullbacks in DPO Approach.
In: Tomasz Szmuc, Marcin Szpyrka & Jaroslav Zendulka: IFIP TC2 Central and East European Conference on Software Engineering Techniques - CEE-SET, Krakow, Pologne, 12/10/09-14/10/09.
Springer-Verlag,
pp. 164–177.
Maxime Rebout, Louis Féraud & Sergei Soloviev (2008):
A Unified Categorical Approach for Attributed Graph Rewriting.
In: E Hirsch & A Razborov: International Computer Science Symposium in Russia (CSR 2008), Moscou 07/06/2008-12/06/2008,
LNCS 5010.
Springer-Verlag,
pp. 398–410,
doi:10.1007/978-3-540-79709-8_39.
Grzegorz Rozenberg (1997):
Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations.
World Scientific,
doi:10.1142/9789812384720.
Hanh Nhi Tran, Christian Percebois, Ali Abou Dib, Louis Féraud & Sergei Soloviev (2010):
Attribute Computations in the DPoPb Graph Transformation Engine (regular paper).
In: 4th International Workshop on Graph Based Tools (GRABATS 2010), University of Twente, Enschede, The Netherlands, 28/09/2010-28/09/2010.
University of Twente,
http://www.utwente.nl/en,
pp. (electronic medium).
eptcs@eptcs.org