J. Abrial, Le prouveur de prédicat Abadi and L. Cardelli. A Theory of Objects, 1996.

]. M. Ac96b, L. Abadi, and . Cardelli, A Theory of Objects, 1996.

]. M. Accl91a, L. Abadi, P. Cardelli, J. Curien, and . Lévy, Explicit substitutions, Journal of Functional Programming, vol.1, issue.4, pp.375-416, 1991.

]. M. Accl91b, L. Abadi, P. Cardelli, J. Curien, and . Levy, Explicit substitutions, Journal of Functional Programming, vol.4, issue.1, pp.375-416, 1991.

J. [. Ariola and . Klop, Equational term graph rewriting, Fundam. Inf, vol.26, issue.3-4, pp.207-240, 1996.

J. [. Ariola and . Klop, Lambda Calculus with Explicit Recursion, Information and Computation, vol.139, issue.2, pp.154-233, 1997.
DOI : 10.1006/inco.1997.2651

[. Andrei and H. Kirchner, Graph Rewriting and Strategies for Modeling Biochemical Networks, Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007), pp.407-414, 2007.
DOI : 10.1109/SYNASC.2007.44
URL : https://hal.archives-ouvertes.fr/inria-00146362

[. Andrei and H. Kirchner, A Rewriting Calculus for Multigraphs with Ports, Electronic Notes in Theoretical Computer Science, vol.219, pp.67-82, 2008.
DOI : 10.1016/j.entcs.2008.10.035
URL : https://hal.archives-ouvertes.fr/inria-00139363

[. Andrei and H. Kirchner, A Higher-Order Graph Calculus for Autonomic Computing, Graph Theory, Computational Intelligence and Thought, pp.15-26, 2009.
DOI : 10.1007/978-3-540-73449-9_5
URL : https://hal.archives-ouvertes.fr/inria-00328554

]. J. All78 and . Allen, Anatomy of LISP, 1978.

A. [. Arbiser, A. Miquel, and . Ríos, A Lambda-Calculus with Constructors, Term Rewriting and Applications ? RTA'06, pp.181-196, 2006.
DOI : 10.1007/11805618_14
URL : https://hal.archives-ouvertes.fr/hal-00150884

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

]. H. Bar92 and . Barendregt, Lambda Calculi with Types, Handbook of Logic in Computer Science, pp.118-310, 1992.

P. [. Bertolissi, H. Baldan, C. Cirstea, and . Kirchner, A Rewriting Calculus for Cyclic Higher-order Term Graphs, Proceedings of TERMGRAPH'04, International Workshop on Term Graph Rewriting, pp.21-41, 2005.
DOI : 10.1016/j.entcs.2005.01.034
URL : https://hal.archives-ouvertes.fr/inria-00100095

C. [. Baldan, H. Bertolissi, C. Cirstea, and . Kirchner, A rewriting calculus for cyclic higher-order term graphs, Mathematical Structures in Computer Science, vol.17, issue.03, pp.363-406, 2006.
DOI : 10.1017/S0960129507006093
URL : https://hal.archives-ouvertes.fr/inria-00100095

C. [. Baldan, H. Bertolissi, C. Cirstea, and . Kirchner, Towards a Sharing Strategy for the Graph Rewriting Calculus, 7th International Workshop on Reduction Strategies in Rewriting and Programming -WRS'07, pp.111-127, 2007.
DOI : 10.1016/j.entcs.2008.03.057
URL : https://hal.archives-ouvertes.fr/inria-00186141

. Bbk-+-07-]-e, P. Balland, R. Brauner, P. Kopetz, A. Moreau et al., Tom : Piggybacking rewriting on java, Proceedings of the 18th Conference on Rewriting Techniques and Applications, pp.36-47, 2007.

O. Bournez, G. Côme, V. Conraud, H. Kirchner, and L. Ibanescu, A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms, Rewriting Techniques and Applications (RTA 2003), volume 2706 of Lecture Notes in Computer Science, pp.30-45, 2003.
DOI : 10.1007/3-540-44881-0_4
URL : https://hal.archives-ouvertes.fr/inria-00099621

M. [. Barendregt, M. Coppo, and . Dezani-ciancaglini, A filter lambda model and the completeness of type assignment, The Journal of Symbolic Logic, vol.37, issue.04, pp.931-940, 1983.
DOI : 10.1002/malq.19800261902

H. [. Bourdier, D. J. Cirstea, H. Dougherty, and . Kirchner, Extensional and Intensional Strategies, 9th International Workshop on Reduction Strategies in Rewriting and Programming -WRS'09 of Electronic Proceedings in Theoretical Computer Science, pp.1-20, 2009.
DOI : 10.4204/EPTCS.15.1
URL : https://hal.archives-ouvertes.fr/inria-00494636

H. [. Bertolissi, C. Cirstea, and . Kirchner, Translating Combinatory Reduction Systems into the Rewriting Calculus, 4th International Workshop on Rule-Based Programming -RULE'03, pp.17-32, 2003.
DOI : 10.1016/S1571-0661(04)80674-1
URL : https://hal.archives-ouvertes.fr/inria-00107640

H. [. Bertolissi, C. Cirstea, and . Kirchner, Expressing combinatory reduction systems derivations in the rewriting calculus, Higher-Order and Symbolic Computation, pp.345-376, 2006.
DOI : 10.1007/s10990-006-0479-z
URL : https://hal.archives-ouvertes.fr/inria-00110869

H. [. Barthe, C. Cirstea, L. Kirchner, and . Liquori, Pure Patterns Type Systems, 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages -POPL'03) of ACM SIGPLAN Notices, pp.250-261, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099463

]. C. Ber05 and . Bertolissi, The graph rewriting calculus : properties and expressive capabilities, Thèse de doctorat, Institut National Polytechnique de Lorraine -INPL, 2005.

C. [. Bertolissi and . Kirchner, The Rewriting Calculus as a Combinatory Reduction System, Foundations of Software Science and Computation Structures -FoSSaCS'07, 2007.
DOI : 10.1007/978-3-540-71389-0_7
URL : https://hal.archives-ouvertes.fr/inria-00121792

C. [. Borovanský, H. Kirchner, and . Kirchner, A functional view of rewriting and strategies for a semantics of ELAN, The Third Fuji International Symposium on Functional and Logic Programming, pp.143-167, 1998.

C. [. Borovansky, H. Kirchner, P. Kirchner, and . Moreau, ELAN from a rewriting logic point of view, Theoretical Computer Science, vol.285, issue.2, pp.155-185, 2002.
DOI : 10.1016/S0304-3975(01)00358-9
URL : https://hal.archives-ouvertes.fr/inria-00100974

T. [. Baader and . Nipkow, Term Rewriting and all That, 1998.

. [. Breazu-tannen, Combining algebra and higher-order types, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, pp.82-90, 1988.
DOI : 10.1109/LICS.1988.5103

]. G. Bur08 and . Burel, A first-order representation of pure type systems using superdeduction, LICS, pp.253-263, 2008.

H. P. Barendregt, M. C. Van-eekelen, J. R. Glauert, J. R. Kennaway, M. J. Plasmeijer et al., Term graph rewriting, Proceedings of PARLE'87, Parallel Architectures and Languages Europe, pp.141-158, 1987.
DOI : 10.1007/3-540-17945-3_8

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., All About Maude -A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Reriting Logic, 2007.

S. [. Clavel, P. Eker, J. Lincoln, and . Meseguer, Principles of Maude, Proceedings of the first international workshop on rewriting logic, 1996.
DOI : 10.1016/S1571-0661(04)00034-9

G. [. Cirstea and . Faure, Confluence of Pattern-Based Calculi, 18th International Conference on Term Rewriting and Applications -RTA'07, pp.78-92, 2007.
DOI : 10.1007/978-3-540-73449-9_8
URL : https://hal.archives-ouvertes.fr/inria-00185882

H. Cirstea, G. Faure, M. Fernandez, I. Mackie, and F. Sinot, From Functional Programs to Interaction Nets via the Rewriting Calculus, 6th International Workshop on Reduction Strategies in Rewriting and Programming -WRS'06, pp.39-56, 2007.
DOI : 10.1016/j.entcs.2007.02.046
URL : https://hal.archives-ouvertes.fr/inria-00000821

G. [. Cirstea, C. Faure, and . Kirchner, A ??-Calculus of Explicit Constraint Application, 5th International Workshop on Rewriting Logic and its Applications -WRLA'04, pp.51-67, 2004.
DOI : 10.1016/j.entcs.2004.06.029
URL : https://hal.archives-ouvertes.fr/inria-00095626

G. [. Cirstea, C. Faure, and . Kirchner, A Rho-Calculus of explicit constraint application. Higher-Order and Symbolic Computation, pp.37-72, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00095626

F. [. Corradini and . Gadducci, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, Theoretical Informatics and Applications, pp.467-493, 1999.
DOI : 10.1051/ita:1999128

[. Curien, T. Hardin, and J. Lévy, Confluence properties of weak and strong calculi of explicit substitutions, Journal of the ACM, vol.43, issue.2, pp.362-397, 1996.
DOI : 10.1145/226643.226675
URL : https://hal.archives-ouvertes.fr/inria-00077189

]. A. Chu41 and . Church, The Calculi of Lambda Conversion, 1941.

C. [. Cirstea, B. Houtmann, and . Wack, Distributive ??-calculus, 6th International Workshop on Rewriting Logic and its Applications -WRLA'06, pp.95-111, 2007.
DOI : 10.1016/j.entcs.2007.06.010
URL : https://hal.archives-ouvertes.fr/inria-00001112

]. H. Cir00 and . Cirstea, Calcul de réécriture : fondements et applications

]. H. Cir01 and . Cirstea, Specifying authentication protocols using rewriting and strategies, Thèse de Doctorat 3rd International Symposium on Practical Aspects of Declarative Languages - PADL'01, pp.138-153, 1990.

C. [. Cirstea and . Kirchner, The Rewriting Calculus as a Semantics of ELAN, 4th Asian Computing Science Conference -ASIAN'98, pp.84-85, 1998.
DOI : 10.1007/3-540-49366-2_7

]. S. Ck99a, D. Cerrito, and . Kesner, Pattern matching as cut elimination, Fourteenth Annual IEEE Symposium on Logic in Computer Science, 1999.

]. H. Ck99b, C. Cirstea, and . Kirchner, Combining higher-order and firstorder computation using rho-calculus : Towards a semantics of ELAN, Frontiers of Combining Systems 2, Research Studies, pp.95-120, 1999.

C. [. Cirstea and . Kirchner, The simply typed rewriting calculus, 3rd International Workshop on Rewriting Logic and Application -WRLA'00, pp.21-37, 2000.
DOI : 10.1016/S1571-0661(05)80127-6
URL : https://hal.archives-ouvertes.fr/inria-00099052

C. [. Cirstea and . 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

D. [. Cerrito and . Kesner, Pattern matching as cut elimination, Theoretical Computer Science, vol.323, issue.1-3, pp.71-127, 2004.
DOI : 10.1016/j.tcs.2004.03.032
URL : https://hal.archives-ouvertes.fr/hal-00148839

C. [. Cirstea, R. Kirchner, P. Kopetz, and . Moreau, Anti-patterns for rule-based languages, Symbolic Computation in Software Science, pp.523-550, 2010.
DOI : 10.1016/j.jsc.2010.01.007
URL : https://hal.archives-ouvertes.fr/inria-00429226

]. H. Ckl01a, C. Cirstea, L. Kirchner, . Liquorickl01b-]-h, C. Cirstea et al., Matching Power The Netherlands The Rho Cube Rewriting Calculus with(out) Types, 12th International Conference on Term Rewriting and Applications -RTA'01 Foundations of Software Science and Computation Structures -FoSSaCS'01 4th International Workshop on Rewriting Logic and Application -WRLA'02, pp.77-92, 2001.

H. Cirstea, C. Kirchner, L. Liquori, and B. Wack, Rewrite Strategies in the Rewriting Calculus, 3rd International Workshop on Reduction Strategies in Rewriting and Programming, pp.18-34, 2003.
DOI : 10.1016/S1571-0661(05)82613-1
URL : https://hal.archives-ouvertes.fr/inria-00099586

C. [. Cirstea, L. Kirchner, B. Liquori, . Wackclw03-]-h, L. Cirstea et al., Rewriting Calculus with Fixpoints: Untyped and First-Order Systems, 17è Journées Francophones des Langages Applicatifs -JFLA 2006 Types for Proofs and Programs -TYPES'03, pp.147-161, 2003.
DOI : 10.1007/978-3-540-24849-1_10
URL : https://hal.archives-ouvertes.fr/inria-00100113

H. Cirstea, P. Moreau, and A. S. Oliveira, Rewrite Based Specification of Access Control Policies, 3rd International Workshop on Security and Rewriting Techniques -SecRet'08, pp.37-54, 2008.
DOI : 10.1016/j.entcs.2009.02.071
URL : https://hal.archives-ouvertes.fr/inria-00335091

P. [. Cirstea, A. Moreau, and . Reilles, Rule-based Programming in Java For Protocol Verification, 5th International Workshop on Rewriting Logic and Application -WRLA'04, pp.209-227, 2004.
DOI : 10.1016/j.entcs.2004.06.022
URL : https://hal.archives-ouvertes.fr/inria-00100025

]. R. De-bruijndg01, B. David, G. Guillaume, T. Dowek, C. Hardin et al., Lambda calculus with namefree formulas involving symbols that represent reference transforming mappings A ?-calculus with explicit weakening and explicit substitution Binding logic : proofs and models, Proceedings of TAPSOFT'93, Theory and Practice of Software Developm ent / 4th International Joint Conference CAAP/FASE Higher order unification via explicit substitutions. Information and Computation Proceedings of the LPAR conference, pp.120-129, 1978.

B. [. Deutsch, R. Lampson-damas, ]. Milnereke95, G. Fages, F. Huet-fisher et al., Principal Type-Schemes for Functional Programs Associative-commutative matching via bipartite graph matching Unification and matching in equational theories A Lambda Calculus of Objects and Method Specialization Exceptions in the rewriting calculus, POPL Proceedings Fifth Colloquium on Automata, Algebra and Programming, L'Aquila (Italy) Proceedings of the Rewriting Techniques and Applications -RTA'02, Lecture Notes in Computer Science, pp.793-799, 1967.

A. [. Faure and . Miquel, A Categorical Semantics for The Parallel Lambda-Calculus, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00424248

I. [. Fernández, F. Mackie, and . Sinot, Interaction Nets vs. the ??-calculus: Introducing Bigraphical Nets, Electronic Notes in Theoretical Computer Science, vol.154, issue.3, pp.19-32, 2006.
DOI : 10.1016/j.entcs.2006.05.004

A. [. Futatsugi and . Nakagawa, An Overview of Cafe Project, Proceedings of First CafeOBJ Workshop, 1996.

]. J. Gim73, A theory of discrete patterns and their implementation in snobol4, Commun. ACM, vol.16, issue.2, pp.91-100, 1973.

. A. Gkk-+-87-]-j, C. Goguen, H. Kirchner, A. Kirchner, J. Mégrelis et al., An introduction to OBJ-3, Proceedings 1st International Workshop on Conditional Term Rewriting Systems Also as internal report CRIN, pp.258-263, 1987.

M. Gordon, A. Milner, and C. Wadsworth, Edinburgh LCF : A Mechanized Logic of Computation, Lecture Notes in Computer Science, vol.78, 1979.
DOI : 10.1007/3-540-09724-4

J. [. Hudak, A gentle introduction to Haskell, ACM SIGPLAN Notices, vol.27, issue.5, pp.1-52, 1992.
DOI : 10.1145/130697.130698

M. [. Honsell, L. Lenisa, and . Liquori, A Framework for Defining Logical Frameworks, Electronic Notes in Theoretical Computer Science, vol.172, pp.399-436, 2007.
DOI : 10.1016/j.entcs.2007.02.014
URL : https://hal.archives-ouvertes.fr/hal-01148312

D. [. Huet and . Oppen, Equations and rewrite rules : A survey Formal Language Theory : Perspectives and Open Problems Confluent reductions : Abstract properties and applications to term rewriting systems, Huet. Résolution d'équations dans les langages d'ordre 1 Thèse de doctorat d'état, pp.349-405797, 1976.

]. B. Jay04 and . Jay, The pattern calculus, ACM Trans. Program. Lang. Syst, vol.26, issue.6, pp.911-937, 2004.

[. Jouannaud and H. Kirchner, Completion of a Set of Rules Modulo a Set of Equations, SIAM Journal on Computing, vol.15, issue.4, pp.1155-1194, 1986.
DOI : 10.1137/0215084

[. Jouannaud, C. [. Kirchner, D. Jay, [. Kesner, M. Jouannaud et al., Computational Logic Essays in honor of Alan Robinson Pure pattern calculus First-class patterns Abstract data type systems Basic pattern matching calculi : Syntax, reduction, confluence, and normalisation Inheritance in smalltalk-80 : A denotational definition The theory of calculi with explicit substitutions revisited Rewriting, solving, proving. A preliminary version Strategic computations and deductions, European Symposium on Programming ? ESOP'06 POPLKes00] D. Kesner. Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. Theoretical Computer Science Reasoning in Simple Type Theory. Festchrift in Honour of Peter B. Andrews on His 70th Birthday of Studies in Logic and the Foundations of Mathematics, pp.257-321, 1988.

C. Kirchner, R. Kopetz, and P. Moreau, Anti-pattern Matching, European Symposium on Programming -ESOP'07, 2007.
DOI : 10.1007/978-3-540-71316-6_9
URL : https://hal.archives-ouvertes.fr/inria-00337722

]. J. Kksdv91, J. W. Kennaway, M. R. Klop, F. J. Sleep, and . De-vries, Transfinite reductions in orthogonal term rewriting systems Extending the explicit substitution paradigm, Proceedings 4th Conference on Rewriting Techniques and Applications 1991. also Report CS-R9041, CWI 16th International Conference on Term Rewriting and Applications -RTA'05, pp.407-422, 1990.

]. P. Kli93 and . Klint, A meta-environment for generating programming environments, ACM Transactions on Software Engineering and Methodology, vol.2, pp.176-201, 1993.

]. J. Klo80 and . Klop, Combinatory Reduction Systems, Mathematisch Centrum, 1980.

]. J. Kvodv08, V. Klop, R. C. Van-oostrom, and . De-vrijer, Lambda calculus with patterns, Theoretical Computer Science, vol.398, issue.1- 3, pp.16-31, 2008.

]. J. Kvovr93, V. Klop, F. Van-oostrom, and . Van-raamsdonk, Combinatory reduction systems : introduction and survey, Theoretical Computer Science, vol.121, pp.279-308, 1993.

D. [. Lapadula and . Bell, MITRE Technical Report 2547, Volume II, Journal of Computer Security, vol.4, issue.2-3, pp.239-263, 1996.
DOI : 10.3233/JCS-1996-42-308

X. Leroy, D. Doligez, J. Guarrigue, D. Rémy, and J. Vouillon, The Objective Caml system http://caml.inria.fr/ pub/docs/manual-ocaml/. [Les94] P. Lescanne. From ?? to ?v a journey through calculi of explicit substitutions, Conference on Principles of Programming Languages -POPL'94, pp.60-69, 1994.

F. [. Liquori, M. Honsell, and . Lenisa, A framework for defining logical frameworks, In Electronic Notes in Theoretical Computer Science, vol.172, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01148312

A. [. Liu and . Myers, JMatch: Iterable Abstract Pattern Matching for Java, PADL '03 : Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages, pp.110-127, 2003.
DOI : 10.1007/3-540-36388-2_9

G. [. Liang and . Nadathur, Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts, Journal of Automated Reasoning, vol.198, issue.1?2, pp.89-132, 2004.
DOI : 10.1007/s10817-004-6885-1

B. [. Liquori and . Serpette, iRho, Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '04, pp.167-178, 2004.
DOI : 10.1145/1013963.1013983
URL : https://hal.archives-ouvertes.fr/hal-01148883

B. [. Liquori and . Serpette, iRho, Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '04, pp.467-500, 2008.
DOI : 10.1145/1013963.1013983
URL : https://hal.archives-ouvertes.fr/hal-01148883

B. [. Liquori and . Wack, The Polymorphic Rewriting-calculus, Proceedings of the Fifth International Workshop on Rewriting Logic and Its Application, pp.89-111, 2005.
DOI : 10.1016/j.entcs.2004.06.027
URL : https://hal.archives-ouvertes.fr/inria-00099910

]. F. Mcb70 and . Mcbride, Computer Aided Manipulation of Symbols, 1970.

]. J. Mcl88 and . Mclean, The algebra of security, Proc. IEEE Symposium on Security and Privacy, pp.2-7, 1988.

]. Mel95 and . Melliès, Typed lambda-calculi with explicit substitutions may not terminate, Second International Conference on Typed Lambda Calculi and Applications -TLCA'95, pp.328-334, 1995.

]. Mel96 and . Melliès, Description Abstraite des Systèmes de Réécriture, 1996.

]. Mel02 and . Melliès, Axiomatic rewriting theory VI residual theory revisited, Rewriting Techniques and Applications ? RTA'02, pp.24-50, 2002.

]. N. Men87 and . Mendler, Inductive Definition in Type Theory, 1987.

]. R. Mil78 and . Milner, A Theory of Type Polymorphism in Programming, Journal of Computer and System Sciences, vol.17, pp.348-375, 1978.

T. [. Mayr and . Nipkow, Higher-order rewrite systems and their confluence, Theoretical Computer Science, vol.192, issue.1, pp.3-29, 1998.
DOI : 10.1016/S0304-3975(97)00143-6

[. 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

]. 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.

M. [. Needham and . Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM, vol.21, issue.12, pp.993-999, 1978.
DOI : 10.1145/359657.359659

]. E. Ohl98 and . Ohlebusch, Church-Rosser theorems for abstract reduction modulo an equivalence relation [Par92] M. Parigot. ?µ-calculus : An algorithmic interpretation of classical natural deduction, Rewriting Techniques and BIBLIOGRAPHIE Applications (RTA-98), volume 1379 of Lecture Notes in Computer Science Proc. of Int. Conf. on Logic Programming and Automated Reasoning, LPAR'92, pp.15-20, 1992.

]. G. Pea89 and . Peano, Arithmetices principia, nova methodo exposita, Fratres Bocca, p.1889

]. S. Pey87 and -. Peyton, Implementation of Functional Programming Languages, 1987.

]. S. Pey03 and . Jones, Special issue : Haskell 98 language and libraries, Journal of Functional Programming, vol.13, 2003.

]. R. Pic07 and . Pickering, Foundations of F#, 2007.

]. G. Plo75, K. H. Plotkin, and . Rose, Call-by-name, call-by-value, and the ?-calculus Operational Reduction Models for Functional Programming Languages, Theoretical Computer Science, vol.1, pp.125-159, 1975.

]. P. Rou75 and . Roussel, Prolog : Manuel de référence et d'utilisation, 1975.

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

]. M. Spve93, M. J. Sleep, M. C. Plasmeijer, and . Van-eekelen, Term graph rewriting : theory and practice, 1993.

]. Ste00 and . Stehr, CINNI ? A generic calculus of explicit substitutions and its application to ?-, ?-and ?-calculi, 3rd International Workshop on Rewriting Logic and its Applications -WRLA'00, pp.71-92, 2000.

]. M. Tak95 and . Takahashi, Parallel reductions in ?-calculus. Information and Compututation, pp.120-127, 1995.

]. D. Tur79 and . Turner, A new implementation technique for applicative languages. Software and Practice and Experience [vD96] A. van Deursen. An Overview of ASF+SDF, Language Prototyping, pp.31-49, 1979.

]. E. Vis99 and . Visser, Strategic pattern matching, Rewriting Techniques and Applications (RTA'99), volume 1631 of Lecture Notes in Computer Science, pp.30-44, 1999.

]. E. Vis01 and . Visser, Stratego : A language for program transformation based on rewriting strategies. System description of Stratego 0.5, Rewriting Techniques and Applications (RTA'01), volume 2051 of Lecture Notes in Computer Science, pp.357-361, 2001.

]. M. Vit94 and . Vittek, ELAN : Un cadre logique pour le prototypage de langages de programmation avec contraintes, Thèse de Doctorat d'Université, 1994.

]. V. Van-oostrom, Lambda calculus with patterns, 1990.

]. B. Wac05 and . Wack, Typage et déduction dans le calcul de réécriture, Thèse de doctorat, 2005.

]. J. Wel99 and . Wells, Typability and Type Checking in System F are Equivalent and Undecidable, Annals of Pure and Applied Logic, vol.98, pp.1-3111, 1999.

]. B. Wer94 and . Werner, Une Théorie des Constructions Inductives, 1994.

C. [. Wack and . Houtmann, Strong normalisation in two Pure Pattern Type Systems, Mathematical Structures in Computer Science, vol.18, issue.03, pp.431-465, 2008.
DOI : 10.1016/S0304-3975(00)00347-9

T. [. Yokouchi and . Hikita, A Rewriting System for Categorical Combinators with Multiple Arguments, SIAM Journal on Computing, vol.19, issue.1, pp.78-97, 1990.
DOI : 10.1137/0219005