O. Andrei, A Rewriting Calculus for Graphs: Applications to Biology and Autonomous Systems, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00337558

O. Andrei, M. Fernández, H. Kirchner, G. Melançon, O. Namet et al., PORGY: Strategy-Driven Interactive Transformation of Graphs, Proceedings of TERMGRAPH 2011, 2011.
DOI : 10.4204/EPTCS.48.7
URL : https://hal.archives-ouvertes.fr/inria-00563249

O. Andrei and H. Kirchner, A Rewriting Calculus for Multigraphs with Ports, Proceedings of RULE'07, pp.67-82, 2008.
DOI : 10.1016/j.entcs.2008.10.035
URL : https://hal.archives-ouvertes.fr/inria-00139363

O. Andrei and H. Kirchner, A Higher-Order Graph Calculus for Autonomic Computing, Graph Theory, Computational Intelligence and Thought. Golumbic Festschrift, pp.15-26, 2009.
DOI : 10.1007/978-3-540-73449-9_5
URL : https://hal.archives-ouvertes.fr/inria-00328554

D. Auber, Tulip ??? A Huge Graph Visualization Framework, Graph Drawing Software, Mathematics and Visualization Series, pp.105-126, 2003.
DOI : 10.1007/978-3-642-18638-7_5

D. Balasubramanian, A. Narayanan, C. P. Van-buskirk, and G. Karsai, The Graph Rewriting and Transformation Language, GReAT. ECEASST, issue.1, 2006.

E. Balland, P. Brauner, R. Kopetz, P. Moreau, and A. Reilles, Tom: Piggybacking Rewriting on Java, LNCS, vol.4533, pp.36-47, 2007.
DOI : 10.1007/978-3-540-73449-9_5
URL : https://hal.archives-ouvertes.fr/inria-00142045

H. Barendregt, The Lambda Calculus, Its Syntax and Semantics, 1981.

H. Barendregt, M. Van-eekelen, J. Glauert, J. R. Kennaway, M. Plasmeijer et al., Term graph rewriting, Proceedings of PARLE, Parallel Architectures and Languages Europe, number 259-II in LNCS, pp.141-158, 1987.
DOI : 10.1007/3-540-17945-3_8

K. Barthelmann, How to construct a hyperedge replacement system for a contextfree set of hypergraphs, 1996.

T. Bourdier, H. Cirstea, D. J. Dougherty, and H. Kirchner, Extensional and Intensional Strategies, Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, pp.1-19, 2009.
DOI : 10.4204/EPTCS.15.1
URL : https://hal.archives-ouvertes.fr/inria-00494636

M. Bravenboer, K. T. Kalleberg, R. Vermaas, and E. Visser, Stratego/XT 0.17. A language and toolset for program transformation, Special issue on Experimental Systems and Tools, 2008.
DOI : 10.1016/j.scico.2007.11.003

A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel et al., ALGEBRAIC APPROACHES TO GRAPH TRANSFORMATION ??? PART I: BASIC CONCEPTS AND DOUBLE PUSHOUT APPROACH, Handbook of Graph Grammars and Computing by Graph Transformations, pp.163-246, 1997.
DOI : 10.1142/9789812384720_0003

B. Courcelle, Graph Rewriting: An Algebraic and Logic Approach Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp.193-242, 1990.

M. Dauchet, Simulation of Turing machines by a left-linear rewrite rule, Proc. of RTA'89, pp.109-120, 1989.
DOI : 10.1007/3-540-51081-8_103

E. W. Dijkstra, Selected writings on computing -a personal perspective. Texts and monographs in computer science, 1982.

H. Ehrig, G. Engels, H. Kreowski, and G. Rozenberg, Handbook of Graph Grammars and Computing by Graph Transformations, 1997.

C. Ermel, M. Rudolf, and G. Taentzer, THE AGG APPROACH: LANGUAGE AND ENVIRONMENT, Handbook of Graph Grammars and Computing by Graph Transformations: Applications, Languages, and Tools, pp.551-603, 1997.
DOI : 10.1142/9789812815149_0014

M. Fernández and O. Namet, Strategic programming on graph rewriting systems, Proceedings International Workshop on Strategies in Rewriting, Proving, and Programming, IWS 2010, pp.1-20, 2010.
DOI : 10.4204/EPTCS.44.1

R. Geiß, G. V. Batz, D. Grund, S. Hack, and A. Szalkowski, GrGen: A Fast SPO- Based Graph Rewriting Tool, Proc. of ICGT, pp.383-397, 2006.

A. Habel, J. Müller, and D. Plump, Double-pushout graph transformation revisited, Mathematical Structures in Computer Science, vol.11, issue.05, pp.637-688, 2001.
DOI : 10.1017/S0960129501003425

A. Habel and D. Plump, Computational Completeness of Programming Languages Based on Graph Transformation, Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001, Proceedings, pp.230-245, 2001.
DOI : 10.1007/3-540-45315-6_15

M. Hanus, Curry: A multi-paradigm declarative language (system description), Twelfth Workshop Logic Programming, WLP'97, 1997.

S. L. Jones, Haskell 98 language and libraries: the revised report, 2003.

C. Kirchner, F. Kirchner, and H. Kirchner, Strategic computations and deductions, Reasoning in Simple Type Theory. Studies in Logic and the Foundations of Mathematics, pp.339-364, 2008.

Y. Lafont, Interaction nets, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.95-108, 1990.
DOI : 10.1145/96709.96718

S. Lucas, Strategies in Programming Languages Today, Electronic Notes in Theoretical Computer Science, vol.124, issue.2, pp.113-118, 2005.
DOI : 10.1016/j.entcs.2004.11.023

N. Martí-oliet, J. Meseguer, and A. Verdejo, Towards a Strategy Language for Maude, Electronic Notes in Theoretical Computer Science, vol.117, pp.417-441, 2005.
DOI : 10.1016/j.entcs.2004.06.020

N. Martí-oliet, J. Meseguer, and A. Verdejo, A Rewriting Semantics for Maude Strategies, Electronic Notes in Theoretical Computer Science, vol.238, issue.3, pp.227-247, 2008.
DOI : 10.1016/j.entcs.2009.05.022

O. Namet, Strategic Modelling with Graph Rewriting Tools. PhD thesis, King's College London, 2011.

U. Nickel, J. Niere, and A. Zündorf, The FUJABA environment, Proceedings of the 22nd international conference on Software engineering , ICSE '00, pp.742-745, 2000.
DOI : 10.1145/337180.337620

M. J. Plasmeijer and M. C. Van-eekelen, Functional Programming and Parallel Graph Rewriting, 1993.

G. D. Plotkin, A structural approach to operational semantics, J. Log. Algebr. Program, pp.60-6117, 2004.

D. P. Ehrig, G. Engels, H. Kreowski, and G. Rozenberg, Term graph rewriting, Handbook of Graph Grammars and Computing by Graph Transformations: Applications, Languages, and Tools, pp.3-61, 1998.

D. Plump, The Graph Programming Language GP, LNCS, vol.5725, pp.99-122, 2009.
DOI : 10.1007/978-3-642-03564-7_6

A. Rensink, The GROOVE Simulator: A??Tool for State Space Generation, AGTIVE, pp.479-485, 2003.
DOI : 10.1007/978-3-540-25959-6_40

G. Rosu and T. Serbanuta, An overview of the K semantic framework, The Journal of Logic and Algebraic Programming, vol.79, issue.6, pp.397-434, 2010.
DOI : 10.1016/j.jlap.2010.03.012

A. Schürr, A. J. Winter, and A. Zündorf, THE PROGRES APPROACH: LANGUAGE AND ENVIRONMENT, Handbook of Graph Grammars and Computing by Graph Transformations, pp.479-546, 1997.
DOI : 10.1142/9789812815149_0013

R. Thiemann, C. Sternagel, J. Giesl, and P. Schneider-kamp, Loops under Strategies ... Continued, Proceedings International Workshop on Strategies in Rewriting , Proving, and Programming, pp.51-65, 2010.
DOI : 10.4204/EPTCS.44.4

E. Visser, Stratego: A Language for Program Transformation Based on Rewriting Strategies System Description of Stratego 0.5, Proc. of RTA'01, pp.357-361, 2001.
DOI : 10.1007/3-540-45127-7_27

E. Visser, A survey of strategies in rule-based program transformation systems, Journal of Symbolic Computation, vol.40, issue.1, pp.831-873, 2005.
DOI : 10.1016/j.jsc.2004.12.011