[. Amadio and . Pierre, Louis Curien ? Domains and lambda-calculi, Cambridge Tracts in Theoretical Computer Science, vol.46, issue.151, pp.147-171, 1998.

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

J. Avigad and K. Donnelly, David Gray et Paul Raff ? « A formally verified proof of the prime number theorem, », ACM Transactions on Computational Logic, p.11, 2007.

. Andrea, Asperti et Guiseppe Longo ? Categories, types and structures, p.147, 1991.

S. Kaplan and M. Okada, Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved, Conditional and Typed Rewriting Systems -CTRS'90Bar92] Henk Barendregt ? « Handbook of logic in computer science », ch. Lambda Calculi with Types, pp.262-271, 1977.

C. Bertolissi and P. Baldan, Horatiu Cirstea et Claude Kirchner ? « A rewriting calculus for cyclic higher-order term graphs, Proceedings of the 2nd International Workshop on Term Graph Rewriting

P. Baldan and C. Bertolissi, Horatiu Cirstea et Claude Kirchner ? « A rewriting calculus for cyclic higher-order term graphs, Mathematical Structures in Computer Science, issue.5, 2006.

G. Barthe, H. Cirstea, C. Kirchner, and L. Liquori, Pierre-Louis Curien et Carolina Lavatelli ? « A semantics for lambda calculi with resources Formal verification of a C compiler front-end », Formal Methods The graph rewriting calculus : properties and expressive capabilities, Pure patterns type systems Principles of Programming Languages - POPL'03 14th International Symposium on Formal Methods Thèse de doctorat, Institut National Polytechnique de Lorraine -INPL, pp.140-437, 1982.

[. Brauner, Clément Houtmann et Claude Kirchner ? « Principles of superdeduction, Logics in Computer Science -LICS'07, 2007.

B. , M. Van-den-brand, and H. Jong, 118 [BK07] Clara Bertolissi et Claude Kirchner ? « The rewriting calculus as a combinatory reduction system, Foundations of Software Science and Computation Structures -FoSSaCS'07 « Controlling Rewriting by Rewriting », 1st International Workshop on Rewriting Logic ? WRLA'96 (Asilomar (CA, USA)) (J. Meseguer Electronic Notes in Theoretical Computer Science, pp.259-291, 1996.

P. Borovansk´yborovansk´y, C. Kirchner-ethéì-ene-kirchner, and ?. , A functional view of rewriting and strategies for a semantics of ELAN, The Third Fuji International Symposium on Functional and Logic Programming (Kyoto) (M. Sato et Y. Toyama World Scientific, pp.143-167, 1998.

E. Balland, C. Kirchner, and P. , A generator of efficient strongly typed abstract syntax trees in java, Proceedings of Algebraic Methodology and Software Technology - AMAST'06 LNCS, sv, july 2006. 207 [Bla05] Frédéric Blanqui ? « Definitions by rewriting in the calculus of constructions », Mathematical Structures in Computer Science IEE Proceedings -Software EngineeringBou94] Gérard Boudol ? « Lambda-calculi for (strict) parallel functions », Information and ComputationBru72] Nicolas G. de Bruijn ? « A lambda calculus notation with nameless dummies , a tool for automatic formula manipulation, with application to the church-rosser theorem », Indagationes Mathematicae, pp.37-92, 1972.

«. Bru78-]-?, Lambda calculus with namefree formulas involving symbols that represent reference transforming mappings, Indagationes Mathematicae, vol.40, pp.348-356, 1978.

J. Hans-jürgen, Bürckert ? « Matching ? A special case of unification ? », Unification, pp.125-138, 1990.

A. Burroni and ?. , Higher-dimensional word problems with applications to equational logic, Theoretical Computer Science, vol.115, issue.1, pp.43-62, 1993.
DOI : 10.1016/0304-3975(93)90054-W

URL : http://doi.org/10.1016/0304-3975(93)90054-w

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., Maude: specification and programming in rewriting logic, CF07] Horatiu Cirstea et Germain Faure ? « Confluence of pattern-based lambda-calculi », Rewriting Techniques and Applications -RTA'07, pp.187-243, 2002.
DOI : 10.1016/S0304-3975(01)00359-0

URL : http://doi.org/10.1016/s0304-3975(01)00359-0

H. Cirstea, G. Faure, and M. Fernandez, Ian Mackie et Francois-Regis Sinot ? « From functional programs to interaction nets via the rewriting calculus », Workshop on Reduction Strategies in Rewriting and Programming -WRS'06, Electronic Notes in Theoretical Computer Science A rho-calculus of explicit constraint application Electronic Notes in Theoretical Computer Science, Mars, Proceedings of the Workshop on Rewriting Logic and Applications -WRLA'04 A rho-calculus of explicit constraint application », Higher-Order and Symbolic Computation Thérèse Hardin et Jean-Jacques Lévy ?, pp.206-99, 2004.

H. Cirstea, C. Houtmann, and B. Wack, Electronic Notes in Theoretical Computer Science The Philippines, Distributive rewriting calculus Sixth International Workshop on Reduction Strategies in Rewriting and Programming ? WRLA'06 Thèse de Doctorat 4th Asian Computing Science Conference Lecture Notes in Computer Science Its Syntax and Basic Properties », Workshop Construction of Computational Logics -CCL'98 The rewriting calculus ? Part I and II », Logic Journal of the Interest Group in Pure and Applied Logics 9, pp.82-122, 1998.

[. Cirstea, C. Kirchner, L. Liquori, and ?. Power, The Netherlands )), Lecture Notes in Computer Science, Rewriting Techniques and Applications -RTA'01 Rewriting Calculus with(out) Types », Workshop on Rewriting Logic and its Applications -WRLA'2002, pp.78-87, 2001.

H. Cirstea and C. Kirchner, Luigi Liquori et Benjamin Wack ? « Rewrite strategies in the rewriting calculus, Electronic Notes in Theoretical Computer Science, p.79, 2003.

[. Cirstea, L. Liquori, B. Wack, and ?. , Rewriting Calculus with Fixpoints: Untyped and First-Order Systems, Lecture Notes in Computer Science, vol.3085, issue.128, pp.147-161, 2003.
DOI : 10.1007/978-3-540-24849-1_10

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

F. Clément, V. Martin, and A. Vodicka, Domain decomposition and skeleton programming with OCamlP3l, Parallel Computing, vol.32, issue.7-8, pp.539-550, 2006.
DOI : 10.1016/j.parco.2006.04.003

[. Church, J. Barkley-rosser, and ?. Some, 17 [Cur93] Régis Curien ? « Second order E-matching as a tool for automated theorem proving, Progress in Artificial Intelligence -EPIA'93), p.205, 1936.

[. David, B. Guillaume, and ?. , A ??-calculus with explicit weakening and explicit substitution, Thérèse Hardin et Claude Kirchner ? « Higher order unification via explicit substitutions », Information and Computation, pp.169-206, 2000.
DOI : 10.1017/S0960129500003224

URL : https://hal.archives-ouvertes.fr/hal-00384683

D. J. Dougherty and C. Kirchner, Modular Access Control Via Strategic Rewriting, Proceedings of 12th European Symposium On Research In Computer Security (ESORICS'07) (Dresden), pp.135-155, 1994.
DOI : 10.1007/978-3-540-74835-9_38

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

«. Ehr05-]-? and . Finiteness, Associative-commutative matching via bipartite graph matching 206 [Fau06] Germain Faure ? « Matching modulo superdevelopments application to second-order matching Matching modulo superdevelopments application to second-order matching » 11 [Fil03] Jean-Christophe Filliâtre ? « Why : a multi-language multi-prover verification tool, Mathematical Structures in Computer Science 13th International Conference on Logic for Programming , Artificial Intelligence, and Reasoning -LPAR'06Fer93] Maribel Fernández ? « Modèles de calculs multiparadigmes fondés sur la réécriture Thèse de doctoratFK02] Germain Faure et Claude Kirchner ? « Exceptions in the rewriting calculus Proceedings of the Rewriting Techniques and Applications -RTA'02 (Copenhagen) (S. Tison, ´ ed.), LNCS, pp.615-646, 1993.

[. Faure, A. Miquel, and ?. , Ian Mackie et François-Régis Sinot ? « Interaction nets vs. the rho-calculus : Introducing bigraphical nets, 12th International Workshop on Expressiveness in Concurrency -EXPRESS'05, Electronic Notes in Theoretical Computer Science, pp.147-206, 2005.

A. Frisch, ?. Ocaml, and +. , Proof of strong normalisation », Essays on Combinatory Logic 20 [Gol81] Donald Goldfarb ? « The undecidability of the second order unification 35 [Gon05] Georges Gonthier ? « A computer-checked proof of the four colour theorem Termination orders for 3-polygraphs », Comptes-Rendus de l'Académie des Sciences -Série I, 11th ACM SIGPLAN International Conference on Functional Programming -ICFP'06 Présentations d'opérades et systèmes de réécriture Thèse, Université Montpellier 2 Termination orders for three-dimensional rewriting »GWZ02] Herman Geuvers, Freek Wiedijk et Jan Zwanenburg ? « A constructive proof of the fundamental theorem of algebra without using the rationals. », Types for Proofs and Programs -TYPES'00, Lectures Notes in Computer Science, pp.192-200, 1980.

M. Hagiya and ?. , 31 [Hin78] J. Roger Hindley ? « Standard and normal reductions, Thérèse Hardin, Mathieu Jaume et Charles Morisset ? « Access control and rewrite systems Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT'06)HL78] Gérard Huet et Bernard Lang ? « Proving and applying program transformations expressed with second-order patterns », Acta Informatica, pp.588-602, 1978.

J. Hannan, D. Miller, and ?. , Uses of higher-order unification for implementing program transformers, 5th International Conference and Symposium on Logic Programming, pp.942-959, 1988.

D. Hendriks, ?. J. Vincent-van-oostrom, . Hindley, and P. Jonathan, Seldin ? An introduction to combinators and the ?-calculus 20 [Hue73] Gérard Huet ? « A mechanization of type theory A unification algorithm for typed lambda-calculus, International Conference on Automated Deduction -CADE'03 Proceedings of the 3rd International Joint Conference on Artificial Intelligence Résolution d'´ equations dans les langages d'ordre 1 Thèse de doctorat d'´ etat Confluent reductions : Abstract properties and applications to term rewriting systems, pp.136-150, 1973.

C. Kirchner and ?. , A new equational unification method : A generalization of martelli-montanari's algorithm, Strategic rewriting », Electr. Notes Theor. Comput. Sci. Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming -WRS'2004, pp.224-247, 1984.

C. Kirchner-ethéì-ene-kirchner and ?. Rewriting, Rule-based programming and proving : The ELAN experience outcomes », Advances in Computer Science -ASIAN 2004, Higher-Level Decision Making, 9th Asian Computing Science Conference, Dedicated to Jean- Louis Lassez on the Occasion of His, Lecture Notes in Computer Science, vol.3321, issue.118, pp.99-363, 1999.

C. Kirchner, R. Kopetz, P. Moreau, and ?. Antipattern, Lecture Notes in Computer Science, European Symposium on Programming -ESOP'07 (Braga, Portugal) [KL05] Delia Kesner et Stephane Lengrand ? « Extending the explicit substitution paradigm 16th International Conference on Term Rewriting and Applications -RTA'05, pp.126-407, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01009675

J. W. Klop and ?. , Combinatory reduction systems, Mathematisch Centrum, vol.33, issue.67, pp.76-135, 1980.

J. W. Klop, Combinatory reduction systems: introduction and survey, Theoretical Computer Science, vol.121, issue.1-2, pp.279-308, 1993.
DOI : 10.1016/0304-3975(93)90091-7

URL : http://doi.org/10.1016/0304-3975(93)90091-7

J. W. Klop, Vincent van Oostrom et Roel de Vrijer ? « Lambda calculus with patterns », Draft 1.2, 21pp, pp.74-125, 2007.

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

L. Liquori, F. Honsell, M. Lenisa, and ?. , Chuck Liang et Gopalan Nadathur ? « Choices in representation and reduction strategies for lambda terms in intensional contexts, Loa03] Ralph Loader ? « Higher order beta matching is undecidable, pp.126-89, 2003.

L. Liquori and P. Bernard, Serpette ? « irho : an imperative rewriting calculus », 6th Conference on Principles and Practice of Declarative Programming ? PPDP'04, pp.167-178, 2004.

L. Liquori, B. Wack, and ?. , The Polymorphic Rewriting-calculus, Electronic Notes in Theoretical Computer ScienceMac98] Saunders Mac Lane ? Categories for the working mathematician, pp.89-111, 1998.
DOI : 10.1016/j.entcs.2004.06.027

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

C. John and . Mitchell, Furio Honsell et Kathleen Fisher ? « A lambda calculus of objects and method specialization 78 [Mil91] Dale Miller ? « A logic programming language with lambda-abstraction, function variables, and simple unification, Journal of Logic and Computation, vol.1, issue.7, pp.31-41, 1991.

N. Martí-oliet, José Meseguer et Alberto Verdejo ? « Towards a strategy language for maude, P6th International Workshop on Rewriting Logic and its Applications -WRLA'06, p.207, 2006.

[. Padovani and ?. , Decidability of fourth-order matching, International Conference on Automated Deduction -CADE'98, pp.361-372, 1998.
DOI : 10.1017/S0960129500003108

URL : https://hal.archives-ouvertes.fr/hal-00527853

S. Peyton-jones and ?. , Special issue : Haskell 98 language and libraries », Journal of Functional Programming, vol.13, issue.5, 2003.

D. Gordon, ?. Plotkin, and . Call, 171 [Qia96] Zhenyu Qian ? « Unification of higher-order patterns in linear time and space, Raa93] Femke van Raamsdonk ? « Confluence and superdevelopments 5th International Conference on Rewriting Techniques and Applications -RTA'93 Confluence and normalisation for higher-order rewriting Thèse de doctorat, pp.125-159, 1975.

A. Reilles and ?. , Kristoffer Høgsbro Rose ? « Operational reduction models for functional programming languages Michaël Rusinowitch ? « Deciding protocol insecurity with rewriting techniques Invited Talk 23 [Sco80a] Dana Scott ? « Lambda calculus : Some models, some philosophy, Canonical abstract syntax trees Theoretical Computer Science Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT'06) Relating theories of the ?-calculus », To H. B. Curry : Essays on Combinatory Logic, Lambda Calculus and Formalism Domains for denotational semantics », International Conference on Algebraic and Logic Programming -ICALP'82 A new category ? domains, spaces and equivalence relations. Lingelbach et Daniel Schobel ? « Rogue decision procedures », 1st International Workshop on Pragmatics of Decision Procedures in Automated Reasoning - PDPAR'03, pp.122-223, 1965.

W. Snyder, J. Gallier, and ?. , Higher-order unification revisited: Complete sets of transformations, Journal of Symbolic Computation, vol.8, issue.1-2, p.59, 1989.
DOI : 10.1016/S0747-7171(89)80023-9

W. Tait and ?. , Intensional interpretations of functionals of finite type I, The Journal of Symbolic Logic, vol.91, issue.02, p.20, 1967.
DOI : 10.1007/BF01447860

M. Bezem, J. W. Klop, R. De-vrijervis01b-]-?, and «. Stratego, Gallier ? « Polymorphic rewriting conserves algebraic strong normalization and confluence 11 [Vis01a] Eelco Visser ? « Stratego : A language for program transformation based on rewriting strategies », Rewriting Techniques and Applications -RTA'01 A language for program transformation based on rewriting strategies. System description of Stratego 0 A survey of strategies in rule-based program transformation systems, Terese ? Term rewriting systems Automata, Languages and Programming, 16th International Colloquium Rewriting Techniques and Applications (RTA'01) (A. Middeldorp Lecture Notes in Computer Science 11 [Wac05] Benjamin Wack ? « Typage et déduction dans le calcul de réécriture Thèse de doctorat Marktoberdorf International Summer School on Program Design Calculi (M. Broy, pp.31-125, 1989.