E. Balland, P. Moreau, and A. Reilles, Bytecode Rewriting in Tom, Electronic Notes in Theoretical Computer Science, vol.190, issue.1, 2007.
DOI : 10.1016/j.entcs.2007.02.058
URL : https://hal.archives-ouvertes.fr/inria-00129513

G. Bonfante, J. Marion, and R. Péchoux, A Characterization of Alternating Log Time by First Order Functional Programs, pp.90-104, 2006.
DOI : 10.1007/11916277_7
URL : https://hal.archives-ouvertes.fr/inria-00110014

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

E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns: Abstraction and Reuse of Object-Oriented Design, Lecture Notes in Computer Science, vol.707, pp.406-431, 1993.
DOI : 10.1007/3-540-47910-4_21

O. Kahramano?-gullar?, P. Moreau, and A. Reilles, Implementing deep inference in TOM, Structures and Deduction, pp.158-172, 2005.

D. Lacey and O. De-moor, Imperative Program Transformation by Rewriting, CC '01: Proceedings of the 10th International Conference on Compiler Construction, pp.52-68, 2001.
DOI : 10.1007/3-540-45306-7_5

P. Moreau, C. Ringeissen, and M. Vittek, A Pattern Matching Compiler for Multiple Target Languages, 12th Conference on Compiler Construction, Warsaw (Poland), pp.61-76, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099427

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

M. , P. Moreau, and J. Vinju, A generator of efficient strongly typed abstract syntax trees in Java, IEE Proceedings -Software Engineering, vol.11, issue.152, pp.70-78, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000700

E. Visser, A Survey of Rewriting Strategies in Program Transformation Systems, Proceedings of the Workshop on Reduction Strategies in Rewriting and Programming (WRS '01), 2001.
DOI : 10.1016/S1571-0661(04)00270-1

E. Visser, Z. Benaissa, and A. Tolmach, Building program optimizers with rewriting strategies, Proceedings of the third ACM SIGPLAN international conference on Functional programming (ICFP '98), pp.13-26, 1998.
DOI : 10.1145/291251.289425
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.1581

J. Visser, Visitor combination and traversal control, Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications (OOPSLA '01), pp.270-282, 2001.
DOI : 10.1145/504311.504302
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.5999

V. L. Winter, Strategy Construction in the Higher-Order Framework of TL, Electronic Notes in Theoretical Computer Science, vol.124, issue.1, pp.149-170, 2005.
DOI : 10.1016/j.entcs.2004.07.020