E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns: Abstraction and Reuse of Object-Oriented Design, 1995.

P. Wadler, The Expression Problem. Mailing list, 1998.

J. Visser, Visitor combination and traversal control, OOPSLA'01: Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, pp.270-282, 2001.

E. Balland, P. Brauner, R. Kopetz, P. Moreau, and R. A. Tom, Tom: Piggybacking Rewriting on Java, Piggybacking rewriting on Java. RTA'07: Proceedings of the 18th International Conference on Rewriting Techniques and Applications, pp.36-47, 2007.
DOI : 10.1007/978-3-540-73449-9_5
URL : https://hal.archives-ouvertes.fr/inria-00142045

E. Balland, P. Moreau, and A. Reilles, Rewriting Strategies in Java, Electronic Notes in Theoretical Computer Science, vol.219, pp.97-111, 2007.
DOI : 10.1016/j.entcs.2008.10.037
URL : https://hal.archives-ouvertes.fr/inria-00274919

F. Baader and T. Nipkow, Term Rewriting and all That, 1998.

M. Van-den-brand, J. Heering, P. Klint, and P. Olivier, Compiling language definitions: the ASF+SDF compiler, ACM Transactions on Programming Languages and Systems, vol.24, issue.4, pp.334-368, 2002.
DOI : 10.1145/567097.567099
URL : https://hal.archives-ouvertes.fr/inria-00101029

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

P. Moreau and H. Kirchner, A compiler for rewrite programs in associative-commutative theories, PLILP'98: Proceedings of the 10th International Symposium on Principles of Declarative Programming, no. 1490 in Lecture Notes in Computer Science, pp.230-249, 1998.
DOI : 10.1007/BFb0056617
URL : https://hal.archives-ouvertes.fr/inria-00098451

M. Clavel and J. Meseguer, Reflection and Strategies in Rewriting Logic1 1Supported by Office of Naval Research Contracts N00014-95-C-0225 and N00014-96-C-0114, National Science Foundation Grant CCR-9224005, and by the Information Technology Promotion Agency, Japan, as a part of the Industrial Science and Technology Frontier Program ???New Models for Software Architecture??? sponsored by NEDO (New Energy and Industrial Technology Development Organization)., RWLW'96: Proceedings of the 1st International Workshop on Rewriting Logic and its Applications, pp.126-148, 2000.
DOI : 10.1016/S1571-0661(04)00037-4

E. Visser, B. Zea, and A. Tolmach, Building program optimizers with rewriting strategies, ACM SIGPLAN Notices, vol.34, issue.1, pp.13-26, 1999.
DOI : 10.1145/291251.289425

K. Futatsugi, J. Goguen, J. Jouannaud, and J. Meseguer, Principles of OBJ-2, Proceedings 12th ACM Symposium on Principles of Programming Languages, pp.52-66, 1985.

M. Van-den-brand, P. Klint, and J. Vinju, Term rewriting with traversal functions, ACM Transactions on Software Engineering and Methodology, vol.12, issue.2, pp.152-190, 2003.
DOI : 10.1145/941566.941568
URL : https://hal.archives-ouvertes.fr/inria-00101030

M. Clavel, Reflection in General Logics, Rewriting Logic, and Maude, Electronic Notes in Theoretical Computer Science, vol.15, 1998.
DOI : 10.1016/S1571-0661(05)82553-8

P. Borovansk´yborovansk´y, C. Kirchner, H. Kirchner, P. Moreau, and M. Vittek, ELAN: A logical framework based on computational systems, WRLA'96: Proceedings of the 1st International Workshop on Rewriting Logic and its Applications Electronic Notes in Theoretical Computer Science, 1996.

P. Borovansk´yborovansk´y, C. Kirchner, and H. Kirchner, Controlling rewriting by rewriting, Proceedings of the 1st International Workshop on Rewriting Logic, 1996.

. Xml-path-language, XPath) Version 2.0 -W3C Recommendation

R. Lämmel, Scrap your boilerplate with XPath-like combinators, POPL'07: Proceedings of the 34th annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.137-142, 2007.

R. Hinze and J. Jeuring, Chapter 1. Generic Haskell: Practice and Theory, Lecture Notes in Computer Science, vol.2793, pp.1-56, 2003.
DOI : 10.1007/978-3-540-45191-4_1

R. Lämmel, P. Jones, and S. , Scrap your boilerplate: a practical design pattern for generic programming, TLDI'03: Proceedings of the ACM SIGPLAN Workshop on Types in Language Design and Implementation, pp.26-37, 2003.

A. Gill, A Haskell Hosted DSL for Writing Transformation Systems, Lecture Notes in Computer Science, vol.219, issue.2, pp.285-309, 2009.
DOI : 10.1016/j.entcs.2008.10.037

M. Odersky and P. Wadler, Pizza into Java, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.146-159, 1997.
DOI : 10.1145/263699.263715

A. Sloane, J. Fernandes, R. Lämmel, J. Visser, and J. Saraiva, Lightweight Language Processing in Kiama, Lecture Notes in Computer Science, vol.6491, pp.408-425, 2011.
DOI : 10.1007/978-3-642-18023-1_12

R. Hinze, J. Jeuring, A. R. Löh, J. Gibbons, R. Hinze et al., Comparing Approaches to Generic Programming in Haskell, Datatype-Generic Programming Backhouse, pp.72-149, 2007.
DOI : 10.1007/978-3-540-76786-2_2

A. Rodriguez, J. Jeuring, P. Jansson, A. Gerdes, O. Kiselyov et al., Comparing libraries for generic programming in Haskell, Haskell'08: Proceedings of the 1st ACM SIGPLAN Symposium on Haskell, pp.111-122, 2008.

P. Moreau, C. Ringeissen, and M. Vittek, A pattern matching compiler for multiple target languages, CC'03: Proceedings of the 12th Conference on Compiler Construction, pp.61-76, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099427

P. Wadler, Views: a way for pattern matching to cohabit with data abstraction, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.307-313, 1987.
DOI : 10.1145/41625.41653

H. Barendregt, The Lambda Calculus ? Its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, 1984.

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

A. Reilles, Canonical Abstract Syntax Trees, Proceedings of the 6th International Workshop on Rewriting Logic and its Applications Electronic Notes in Theoretical Computer Science, pp.165-179, 2006.
DOI : 10.1016/j.entcs.2007.06.014
URL : https://hal.archives-ouvertes.fr/inria-00000967

R. Bruni, A. Corradini, F. Gadducci, A. Lafuente, and A. Vandin, Modelling and analyzing adaptive self-assembling strategies with Maude, WRLA'12: Proceedings of the 9th International Workshop on Rewriting Logic and its Applications, 2012.
DOI : 10.1007/978-3-642-34005-5_7
URL : http://eprints.imtlucca.it/3491/

G. Feuillade, T. Genet, V. Triem-tong, and V. , Reachability Analysis over Term Rewriting Systems, Journal of Automated Reasoning, vol.37, issue.1?2, pp.3-4341, 2004.
DOI : 10.1007/s10817-004-6246-0
URL : https://hal.archives-ouvertes.fr/inria-00071609

R. Lämmel, S. Thompson, and M. Kaiser, Programming Errors in Traversal Programs Over Structured Data, LDTA'08: Proceedings of the 8th Workshop on Language Descriptions, Tools, and Applications, pp.135-153, 2009.
DOI : 10.1016/j.entcs.2009.09.045

E. Balland and P. Moreau, Optimizing pattern matching compilation by program transformation, SeTra'06: Proceedings of the 3rd Workshop on Software Evolution through Transformations, Electronic Communications of EASST, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00001127

O. Andrei, M. Fernández, H. Kirchner, G. Melançon, O. Namet et al., PORGY: Strategy-Driven Interactive Transformation of Graphs, TERMGRAPH'11: Proceedings of the 6th International Workshop on Computing with Terms and Graphs, Electronic Proceedings in Theoretical Computer Science, pp.54-68, 2011.
DOI : 10.4204/EPTCS.48.7
URL : https://hal.archives-ouvertes.fr/inria-00563249

D. Lacey and O. De-moor, Imperative Program Transformation by Rewriting, CC'01: Proceedings of the 10th International Conference on Compiler Construction, no. 2027 in Lecture Notes in Computer Science, pp.52-68, 2001.
DOI : 10.1007/3-540-45306-7_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.9816

E. Balland, P. Moreau, and A. Reilles, Bytecode Rewriting in Tom, BYTECODE'07: Proceedings of the 2nd International Workshop on Bytecode Semantics, Verification, pp.19-33, 2007.
DOI : 10.1016/j.entcs.2007.02.058
URL : https://hal.archives-ouvertes.fr/inria-00129513

T. Kuipers and J. Visser, Object-oriented tree traversal with JJForester, CWI (Centre for Mathematics and Computer Science), 2000.
DOI : 10.1016/s1571-0661(04)80919-8
URL : http://doi.org/10.1016/s1571-0661(04)80919-8

M. Keith and M. Schincariol, Pro EJB 3: Java Persistence API (Pro) Apress, 2006.

R. Kopetz and P. Moreau, Software Quality Improvement Via Pattern Matching, FASE'08: Proceedings of the 11th International Conference on Fundamental Approaches to Software Engineering, pp.296-300, 2008.
DOI : 10.1007/978-3-540-78743-3_22
URL : https://hal.archives-ouvertes.fr/inria-00336703

D. Steinberg, F. Budinsky, M. Paternostro, and E. Merks, EMF: Eclipse Modeling Framework 2.0, 2009.

S. Sendall and W. Kozaczynski, Model transformation: the heart and soul of model-driven software development, IEEE Software, vol.20, issue.5, pp.42-45, 2003.
DOI : 10.1109/MS.2003.1231150

H. Cirstea, P. Moreau, and A. Reilles, TomML: A Rule Language for Structured Data, RuleML'09: Proceedings of the International Symposium on Rule Interchange and Applications, pp.262-271, 2009.
DOI : 10.1007/978-3-642-04985-9_24
URL : https://hal.archives-ouvertes.fr/inria-00429229

B. Tavernier and . Calife, Calife: A Generic Graphical User Interface for Automata Tools, LDTA'04: Proceedings of the 4th Workshop on Language Descriptions, Tools, and Applications, pp.169-172, 2004.
DOI : 10.1016/j.entcs.2004.06.004

. Brunetonébruneton´brunetoné, R. Lenglet, and T. Coupaye, ASM: a code manipulation tool to implement adaptable systems, ACM SIGOPS France) Journées Composants 2002 : SystèmesSystèmes`Systèmesà composants adaptables et extensibles (Adaptable and extensible component systems), 2002.

E. Balland and P. Moreau, Term-Graph Rewriting Via Explicit Paths, RTA'08: Proceedings of the 19th International Conference on Rewriting Techniques and Applications, pp.32-47, 2008.
DOI : 10.1007/978-3-540-70590-1_3
URL : https://hal.archives-ouvertes.fr/inria-00173535

M. Fernández and I. Mackie, A Calculus for Interaction Nets, PPDP'99: Proceedings of the International Conference on Principles and Practice of Declarative Programming, pp.170-187, 1999.
DOI : 10.1007/10704567_10