. Heering, Paul Klint et Peter Olivier ? « Compiling language definitions : the ASF+SDF compiler, ACM Trans. Program. Lang. Syst, vol.24, issue.4, pp.334-368, 2002.

C. Peter-borovanský, H. Kirchner, P. Kirchner, C. Moreau, ?. Ringeissen et al., Electronic Notes in Theoretical Computer Science, Septembre 1998 Compilation and memory management for asf+sdf, Proceedings of the 2nd International Workshop on Rewriting Logic and its ApplicationsBKM06] Émilie Balland, Claude Kirchner et Pierre-Étienne Moreau ? « Formal islands Proceedings of the 11th International Conference on Algebraic Methodology and Software Technology (AMAST'06) (Kuressaare, Estonia) Proceedings of the 8th International Conference on Compiler Construction (CC'99) Paul Klint et Jurgen Vinju ? « Term rewriting with traversal functions Éric Bruneton, Romain Lenglet et Thierry Coupaye ? « ASM : a code manipulation tool to implement adaptable systems Proceedings of the ASF (ACM SIGOPS France) Journées Composants 2002 : Systèmes à composants adaptables et extensibles (Adaptable and extensible component systems ), pp.36-198, 1999.

[. Favre, R. Heckel, and T. Mens, To appear. 156 [BMV05] Mark van den Brand, Pierre-Étienne Moreau et Jurgen Vinju ? « A generator of efficient strongly typed abstract syntax trees in java [Bor95] Peter Borovanský ? « Implementation of higher-order unification based on calculus of explicit substitutions, Electronic Communications of EASST Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'95)) (M. Barto?ek, J. Staudek et J. Wiedermann, éds.), Lecture Notes in Computer Science, pp.70-78, 1995.

. Bor98-]-? and . Le-contrôle-de-la-réécriture, étude et implantation d'un formalisme de stratégies, Thèse de Doctorat d'Université, p.123, 1998.

M. Bravenboer, R. Vermaasr, M. Glück, and . Lowry, Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax, Proceedings of the Fourth International Conference on Generative Programming and Component Engineering (GPCE'05), pp.157-172, 2005.
DOI : 10.1007/11561347_12

S. Robert, Y. Boyer, and ?. Yu, Automated correctness proofs of machine code programs for a commercial microprocessor, Proceedings of the 11th International Conference on Automated Deduction (D. Kapur, pp.416-430, 1992.

M. Clavel and . Jos, Reflection and strategies in rewriting logic, Horatiu Cirstea, Pierre-Étienne Moreau et Antoine Reilles ? « Rule based programming in Java for protocol verification Proceedings of the 5th International Workshop on Rewriting Logic and its Applications (N. Marti-Oliet Electronic Notes in Theoretical Computer Science, pp.14-209, 2000.

M. Dauchet and ?. , Simulation of Turing machines by a left-linear rewrite rule, Proceedings 3rd Conference on Rewriting Techniques and Applications (N. DershowitzDF01] Olivier Dubuisson et Philippe Fouquart ? ASN.1 : communication between heterogeneous systems, pp.109-120, 1989.
DOI : 10.1007/3-540-51081-8_103

E. Gamma, R. Helm, R. Johnson, J. Vlissides, ?. Design et al., Design Patterns: Abstraction and Reuse of Object-Oriented Design, Electronic Notes in Theoretical Computer Science (M. van den Brand Proceedings of the 2nd eclipse Technology eXchange workshop (eTX'2004) (B. Barry et O. de Moor Electronic Notes in Theoretical Computer Science Sumit Gulwani et George C. Necula ? « Global value numbering using random interpretation Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.406-431, 1978.
DOI : 10.1007/3-540-47910-4_21

[. Goubault and ?. Himml, Standard ML with fast sets and maps, p.67, 1994.

J. and C. Marché, « Generation of abstract programming interfaces from syntax definitions, Kah87] Gilles Kahn ? « Natural semantics », 4th Annual Symposium on Theoretical Aspects of Computer Sciences (STACS'87), pp.29-51, 1987.

C. Kirchner, H. Kirchner, M. Vittek, and ?. , Designing Constraint Logic Programming Languages using Computational Systems », Principles and Practice of Constraint Programming, pp.131-158, 1995.

K. Kiczales, J. Lamping, A. Menhdhekar, C. Maeda, and C. Lopes, Jean-Marc Loingtier et John Irwin ? « Aspect-oriented programming, Proceedings European Conference on Object-Oriented Programming (M. Ak?it et S. Matsuoka, pp.220-242, 1997.

C. Kirchner, C. Lynch, C. Scharff, and ?. , Fine-grained concurrent completion, Proceedings of the 7th Conference on Rewriting Techniques and Applications (RTA'96) (H. Ganzinger, pp.3-17, 1996.
DOI : 10.1007/3-540-61464-8_39

URL : https://hal.archives-ouvertes.fr/inria-00073707

H. Kirchner, P. Moreau, and ?. , Prototyping completion with constraints using computational systems, Proceedings 6th Conference on Rewriting Techniques and Applications (J. Hsiang, pp.438-443, 1995.
DOI : 10.1007/3-540-59200-8_79

URL : http://www.loria.fr/~moreau/Papers/KirchnerM-RTA95.pdf

C. Kirchner, P. Moreau, and A. Reilles, The Netherlands, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming ix, 3 [KV00] Tobias Kuipers et Joost Visser ? « Object-oriented tree traversal with JJForester CWI (Centre for Mathematics and Computer Science), pp.187-197, 2000.

X. Leroy, D. Doligez, and J. Guarrigue, Didier Rémy et Jérôme Vouillon ? « The Objective Caml system, 2004.

[. Lacey and N. D. Jones, Eric Van Wyk et Carl Christian Frederiksen ? « Proving correctness of compiler optimizations by temporal logic, Proceedings of the 29th ACM Symposium on Principles of Programming Languages, pp.283-294, 2002.

G. Lowe and ?. , An attack on the Needham-Schroeder public-key authentication protocol, Information Processing Letters, vol.56, issue.3, pp.131-133, 1995.
DOI : 10.1016/0020-0190(95)00144-2

C. Marché and ?. , Normalized Rewriting: an Alternative to Rewriting modulo a Set of Equations, Journal of Symbolic Computation, vol.21, issue.3, pp.253-288, 1996.
DOI : 10.1006/jsco.1996.0011

P. Moreau and ?. , Compilation de règles de réécriture et de stratégies non-déterministes, Thèse de Doctorat d'Université, p.116, 1999.

P. Moreau, O. Zendra, and ?. Gc, GC2: a generational conservative garbage collector for the ATerm library, The Journal of Logic and Algebraic Programming, vol.59, issue.1-2, pp.5-34, 2004.
DOI : 10.1016/j.jlap.2003.12.003

URL : https://hal.archives-ouvertes.fr/inria-00072040

D. P. Oliva and D. John, Ramsdell et Mitchell Wand ? « The VLISP verified PreScheme compiler », Lisp Symb, Comput, vol.8, issue.12, pp.111-182, 1995.

[. Odersky, P. Wadler, and ?. , 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. Reilles and ?. , Canonical Abstract Syntax Trees, Proceedings of the 6th International Workshop on Rewriting Logic and its Applications, p.4, 2006.
DOI : 10.1016/j.entcs.2007.06.014

URL : https://hal.archives-ouvertes.fr/inria-00000967

C. Martin, Rinard et Darko Marinov ? « Credible compilation with pointers, Proceedings of the FLoC Workshop on Run-Time Result Verification, p.35, 1999.

M. Strecker and ?. Formal, Eelco Visser et Zine-el-Abidine Benaissa ? « A core language for rewriting », Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications (WRLA'98) (Pont, Proceedings of the 18th International Conference on Automated Deduction] Eelco Visser, Zine-el-Abidine Benaissa et Andrew Tolmach ? « Building program optimizers with rewriting strategies Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pp.63-77, 1998.

C. Daniel, A. W. Wang, . Appel, and L. Jeff, Korn ? « The zephyr abstract syntax description language, Wan95] Mitchell Wand ? « Compiler correctness for parallel languages Proceedings of the seventh international conference on Functional programming languages and computer architecture (FPCA'95) Andrew W. Appel et Aaron Stump ? « Foundational proof checkers with small witnesses Proceedings of the 5th ACM SIGPLAN international Conference on Principles and Practice of Declarative Programming et Yannis Smaragdakis ? « Generating aspectj programs with meta-aspectj. », Proceedings of the 3rd International Conference on Generative Programming and Component Engineering (GPCE'04), pp.72-120, 1995.

I. Pico-exécutant-un-programme-de-tests-de-primalité and .. , 82 (a) Programme Pico effectuant les tests 82 (b). Temps d'exécution de l'interprète, p.82

. .. La-structure-objet-de-la-représentation-explicite-de-bottomup, .. Représentant-bottomup, and .. Un-noeud-mu, 127 (a) Graphe 127 (b) Représentation d', p.127

.. Stratégies-basées-sur-l-'identité, 133 (a) Tableau des stratégies basées sur l'identité 133 (b) Application d'un système de réécriture sous stratégie basée sur l'identité, p.133

.. Deux-versions-de-la-recherche-de-doublons-dans-une-liste, 148 (a) Recherche de doublons non-linéaire 148 (b), Recherche de doublons avec test, p.148