E. Balland, C. Kirchner, and P. Moreau, Formal Islands, Proceedings of AMAST 2006, pp.51-65, 2006.
DOI : 10.1007/11784180_7
URL : https://hal.archives-ouvertes.fr/inria-00001146

P. Borovansk´yborovansk´y, C. Kirchner, and H. Kirchner, Controlling rewriting by rewriting

P. Borovansk´yborovansk´y, C. Kirchner, H. Kirchner, P. Moreau, and C. Ringeissen, An overview of ELAN, Proceedings of WRLA 1998, 1998.

M. Brand, A. Deursen, J. Heering, H. Jong, M. Jonge et al., The ASF+SDF Meta-Environment: a Component-Based Language Development Environment, Compiler Construction, pp.365-370, 2001.

M. Brand, P. Klint, and P. Olivier, Compilation and Memory Management for ASF+SDF, Compiler Construction, pp.198-213, 1999.

P. Brauner, C. Houtmann, and C. Kirchner, Principles of Superdeduction, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007.
DOI : 10.1109/LICS.2007.37
URL : https://hal.archives-ouvertes.fr/inria-00133557

H. Cirstea and C. Kirchner, The rewriting calculus - part II, Logic Journal of IGPL, vol.9, issue.3, pp.427-498, 2001.
DOI : 10.1093/jigpal/9.3.377
URL : https://hal.archives-ouvertes.fr/inria-00100532

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., The Maude 2.0 System, Proceedings of RTA 2003, pp.76-87, 2003.
DOI : 10.1007/3-540-44881-0_7

C. Kirchner, R. Kopetz, and P. Moreau, Anti-pattern Matching, Proceedings of the 16th European Symposium on Programming, pp.110-124, 2007.
DOI : 10.1007/978-3-540-71316-6_9
URL : https://hal.archives-ouvertes.fr/inria-00337722

C. Kirchner, P. Moreau, and A. Reilles, Formal validation of pattern matching code, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '05, pp.187-197, 2005.
DOI : 10.1145/1069774.1069792
URL : https://hal.archives-ouvertes.fr/inria-00000701

X. Leroy, The objective caml system release 3.09

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

A. Reilles, Canonical Abstract Syntax Trees, Proceedings of WRLA 2006, 2006.
DOI : 10.1016/j.entcs.2007.06.014
URL : https://hal.archives-ouvertes.fr/inria-00000967

M. Van-den-brand, H. De-jong, P. Klint, and P. Olivier, Efficient annotated terms. Software, Practice and Experience, pp.259-291, 2000.

M. Van-den-brand, P. Moreau, and J. Vinju, Generator of efficient strongly typed abstract syntax trees in Java, IEE Proceedings -Software Engineering, pp.70-78, 2005.
DOI : 10.1049/ip-sen:20041181
URL : https://hal.archives-ouvertes.fr/inria-00000700

E. Visser, Z. Benaissa, and A. Tolmach, Building program optimizers with rewriting strategies, Proceedings of the third ACM SIGPLAN international conference on Functional programming, pp.13-26, 1998.

J. Visser, Visitor combination and traversal control, Proceedings of the 16th ACM SIGPLAN conference on OOPSLA, pp.270-282, 2001.