O. Andrei, M. Fernández, H. Kirchner, G. Melançon, O. Namet & B. Pinaud (2010):
PORGY: Strategy Driven Interactive Visulation and Transformation of Graphs.
Submitted. Available at http://www.oliviernamet.co.uk/Publications.html.
Oana Andrei & Hélène Kirchner (2008):
A Rewriting Calculus for Multigraphs with Ports..
In: Proceedings of RULE'07,
Electronic Notes in Theoretical Computer Science 219,
pp. 67–82.
Oana Andrei & Hélène Kirchner (2009):
A Higher-Order Graph Calculus for Autonomic Computing.
In: M. and al. Lipshteyn: Graph Theory, Computational Intelligence and Thought. Golumbic Festschrift,
Lecture Notes in Computer Science 5420.
Springer,
pp. 15–26.
Franz Baader & Tobias Nipkow (1998):
Term rewriting and all that.
Cambridge University Press,
Great Britain.
Daniel Balasubramanian, Anantha Narayanan, Christopher P. van Buskirk & Gabor Karsai (2006):
The Graph Rewriting and Transformation Language: GReAT.
ECEASST 1.
Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau & Antoine Reilles (2007):
Tom: Piggybacking Rewriting on Java..
In: Franz Baader: RTA,
LNCS 4533.
Springer,
pp. 36–47.
H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J. R. Kennaway, M.J. Plasmeijer & M.R. Sleep (1987):
Term graph rewriting.
In: Proceedings of PARLE, Parallel Architectures and Languages Europe 259-II,
LNCS.
Springer-Verlag,
Eindhoven, The Netherlands,
pp. 141–158.
Klaus Barthelmann (1996):
How To Construct A Hyperedge Replacement System For A Context-Free Set Of Hypergraphs.
Technical Report.
Universität Mainz, Institut für Informatik.
Peter Borovansky, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau & Christophe Ringeissen (1998):
An Overview of ELAN.
In: Hélène Kirchner, Claude & Kirchner: Second Workshop on Rewriting Logic and its Applications - WRLA'98 Electronic Notes in Theoretical Computer Science,
Electronic Notes in Theoretical Computer Science 15.
Elsevier Science B. V.,
Pont-à-Mousson, France,
pp. 16 p.
Available at http://hal.inria.fr/inria-00098518/en/.
Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau & Christophe Ringeissen (1998):
An overview of ELAN.
ENTCS 15.
Bruno Courcelle (1990):
Graph Rewriting: An Algebraic and Logic Approach.
In: J. van Leeuwen: Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics.
Elsevier Science Publishers and MIT Press,
pp. 193–242.
Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski & Grzegorz Rozenberg (1997):
Handbook of Graph Grammars and Computing by Graph Transformations, Volume 2: Applications, Languages, and Tools.
World Scientific.
Hartmut Ehrig, Hans-Jörg Kreowski, Ugo Montanari & Grzegorz Rozenberg (1997):
Handbook of Graph Grammars and Computing by Graph Transformations, Volume 3: Concurrency, Parallelism, and Distribution.
World Scientific.
Claudia Ermel, Michael Rudolf & Gabriele Taentzer (1997):
The AGG Approach: Language and Environment.
In: 1997handbook2,
pp. 551–603.
M. Fernández, H. Kirchner & O. Namet (2010):
A strategy language for graph rewriting.
Available from http://www.oliviernamet.co.uk/Publications.html.
Maribel Fernández & Ian Mackie (1999):
A Calculus for Interaction Nets.
In: Proceedings of PPDP'99, Paris 1702,
Lecture Notes in Computer Science.
Springer.
Rubino Geiß, Gernot Veit Batz, Daniel Grund, Sebastian Hack & Adam Szalkowski (2006):
GrGen: A Fast SPO-Based Graph Rewriting Tool.
In: Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro & Grzegorz Rozenberg: ICGT,
LNCS 4178.
Springer,
pp. 383–397.
Georges Gonthier, Mart\'ın Abadi & Jean-Jacques Lévy (1992):
The Geometry of Optimal Lambda Reduction.
In: Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL'92).
ACM Press,
pp. 15–26.
Yves Lafont (1990):
Interaction Nets.
In: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL'90).
ACM Press,
pp. 95–108.
Ian Mackie (2001).
Habilitation à diriger des recherches en informatique, Université de Paris 7.
Ian Mackie (2004):
Efficient λ-evaluation with interaction nets.
In: V. van Oostrom: Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA'04),
Lecture Notes in Computer Science 3091.
Springer-Verlag,
pp. 155–169.
John Mccarthy (1963):
A Basis for a Mathematical Theory of Computation.
In: Computer Programming and Formal Systems.
North-Holland,
pp. 33–70.
Ulrich Nickel, Jörg Niere & Albert Zündorf (2000):
The FUJABA environment.
In: ICSE,
pp. 742–745.
Detlef Plump (1998):
Term Graph Rewriting.
Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools, Chapter 1, pages 3-61, eds. H. Ehrig, G. Engels, H.-J. Kreowski and G. Rozenberg. World Scientific.
Detlef Plump (2009):
The Graph Programming Language GP.
In: Symeon Bozapalidis & George Rahonis: CAI,
LNCS 5725.
Springer,
pp. 99–122.
Arend Rensink (2003):
The GROOVE Simulator: A Tool for State Space Generation.
In: John L. Pfaltz, Manfred Nagl & Boris Böhlen: AGTIVE,
LNCS 3062.
Springer,
pp. 479–485.
Grzegorz Rozenberg (1997):
Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations.
World Scientific.
Andy Schürr, Andreas J. Winter & Albert Zündorf (1997):
The PROGRES Approach: Language and Environment..
In: 1997handbook2,
pp. 479–546.
Eelco Visser (2001):
Stratego: A Language for Program Transformation based on Rewriting Strategies. System Description of Stratego 0.5.
In: A. Middeldorp: Rewriting Techniques and Applications (RTA'01),
Lecture Notes in Computer Science 2051.
Springer-Verlag,
pp. 357–361.
eptcs@eptcs.org