L. [. Abadi, P. Cardelli, J. Curien, and . Lévy, Abstract, Journal of Functional Programming, vol.34, issue.04, pp.375-416, 1991.
DOI : 10.1016/0304-3975(86)90035-6

H. P. Barendregt, The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics, 1984.

]. P. Bkk98a, C. Borovansk´yborovansk´y, H. Kirchner, and . Kirchner, A functional view of rewriting and strategies for a semantics of ELAN, In International Journal of Foundations of Computer Science, 2001.

. Bkk-+-98b-]-p, C. Borovansk´yborovansk´y, H. Kirchner, P. Kirchner, C. Moreau et al., An overview of ELAN, Proc. of WRLA'98, 1998.

S. [. Clavel, P. Eker, J. Lincoln, and . Meseguer, Principles of Maude, Proc. of WRLA'96, 1996.
DOI : 10.1016/S1571-0661(04)00034-9

]. H. Cir00 and . Cirstea, Calcul de réécriture : fondements et applications, Thèse de Doctorat, 2000.

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

H. Cirstea, C. Kirchner, and L. Liquori, Rewriting Calculus with(out) Types, Proc. of WRLA'02, 2002.
DOI : 10.1016/S1571-0661(05)82526-5
URL : https://hal.archives-ouvertes.fr/inria-00100858

C. [. Cirstea, L. Kirchner, B. Liquori, and . Wack, Rewrite Strategies in the Rewriting Calculus, Proc. of WRS'03, 2003.
DOI : 10.1016/S1571-0661(05)82613-1
URL : https://hal.archives-ouvertes.fr/inria-00099586

]. N. De-bruijn, Lambda-calculus with name free formulas involving symbols that represent reference transforming mappings, Indagationes Mathematicae, vol.40, pp.348-356, 1978.

G. Dowek, T. Hardin, and C. Kirchner, Higher-order unification via explicit substitutions, Information and Computation, pp.183-235, 2000.
URL : https://hal.archives-ouvertes.fr/hal-01199528

]. S. Eke95 and . Eker, Associative-Commutative Matching Via Bipartite Graph Matching, The Computer Journal, vol.38, issue.5, pp.381-399, 1995.

G. Faure, Explicit rewriting calculus, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00096026

G. Faure and C. Kirchner, Exceptions in the Rewriting Calculus, Proc. of RTA'02, pp.66-82, 2002.
DOI : 10.1007/3-540-45610-4_6
URL : https://hal.archives-ouvertes.fr/inria-00101011

D. Hendriks and V. Van-oostrom, The adbmal-calculus, Proc. of CADE'03, volume 2741 of LNAI, pp.136-150, 2003.

J. Klop, Combinatory Reduction Systems, Mathematisch Centrum -Amsterdam, 1980.

P. Lescanne, From ?? to ?v a journey through calculi of explicit substitutions, Conference Record of POPL '94, pp.60-69, 1994.

C. Liang, G. Nadathur, and X. Qi, Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts, Journal of Automated Reasoning, vol.198, issue.1?2, 2003.
DOI : 10.1007/s10817-004-6885-1

L. Liquori and B. P. Serpette, An imperative rewriting calculus, Proc. of PPDP'04, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01147678

P. Moreau, C. Ringeissen, and M. Vittek, A Pattern Matching Compiler for Multiple Target Languages, Proc. of CC'03, pp.61-76, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099427

]. C. Muñ97 and . Muñoz, Un calcul de substitutions pour la représentation de preuves partielles en théorie de types, Thèse de doctorat, 1997.

Q. Nguyen, Certifying Term Rewriting Proofs in ELAN, Proc. of RULE'01, 2001.
DOI : 10.1016/S1571-0661(04)00295-6

K. H. Rose, Operational Reduction Models for Functional Programming Languages, 1996.

]. A. Sdk-+-03, A. Stump, S. Deivanayagam, D. Kathol, D. Lingelbach et al., Rogue decision procedures, International Workshop on Pragmatics of Decision Procedures in Automated Reasoning, 2003.

E. Chailloux, P. Manoury, and B. , Pagano Développement d'applications avec Objective Caml, 2000.
DOI : 10.3166/tsi.24.1055-1080