H. Barendregt, Lambda Calculus: its Syntax and Semantics, 1984.

G. Barthe, H. Cirstea, C. Kirchner, and L. Liquori, Pure Patterns Type Systems, Principles of Programming Languages -POPL2003, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099463

C. Bertolissi, The graph rewriting calculus : properties and expressive capabilities, Thèse de doctorat, Institut National Polytechnique de Lorraine -INPL, 2005.
URL : https://hal.archives-ouvertes.fr/tel-00011037

A. Church, A formulation of the simple theory of types, The Journal of Symbolic Logic, vol.1, issue.02, pp.56-68, 1941.
DOI : 10.2307/2371199

A. Church and J. B. Rosser, Some properties of conversion, Transactions of the American Mathematical Society, vol.39, issue.3, 1936.
DOI : 10.1090/S0002-9947-1936-1501858-0

H. Cirstea, Calcul de réécriture : fondements et applications, Thèse de Doctorat d'Université, 2000.

H. Cirstea, G. Faure, M. Fernández, I. Mackie, and F. Sinot, New evaluation strategies for functional languages via the rho calculus

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, Matching Power, Proc. of RTA, pp.77-92, 2001.
DOI : 10.1007/3-540-45127-7_8

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

H. Cirstea, C. Kirchner, and L. Liquori, Rewriting Calculus with(out) Types, Proceedings of the fourth workshop on rewriting logic and applications Electronic Notes in Theoretical Computer Science, 2002.
DOI : 10.1016/S1571-0661(05)82526-5

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

H. Cirstea, C. Kirchner, L. Liquori, and B. Wack, Rewrite Strategies in the Rewriting Calculus, Proceedings of the Third International Workshop on Reduction Strategies in Rewriting and Programming Electronic Notes in Theoretical Computer Science, 2003.
DOI : 10.1016/S1571-0661(05)82613-1

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

H. Cirstea, L. Liquori, and B. Wack, Rewriting Calculus with Fixpoints: Untyped and First-Order Systems, Proc. of Types, International Workshop on Types for Proof and Programs, pp.147-161, 2003.
DOI : 10.1007/978-3-540-24849-1_10

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

M. Fernández, I. Mackie, and F. Sinot, Interaction nets vs. the rho-calculus: Introducing bigraphical nets, Proceedings of EXPRESS'05, satellite workshop of Concur Electronic Notes in Computer Science, 2005.

G. Gonthier, J. Levy, and P. Mellies, An abstract standardisation theorem, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.72-81, 1992.
DOI : 10.1109/LICS.1992.185521

J. Hindley, Reductions of residuals are finite. Transactions of the, pp.345-361, 1978.

H. Cirstea, G. Faure, and C. Kirchner, A rho-calculus of explicit constraint application, Proceedings of the 5th workshop on rewriting logic and applications. Electronic Notes in Theoretical Computer Science, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00095626

G. Huet, Résolution d'equations dans les langages d'ordre 1, Thèse de Doctorat d'Etat, 1976.

J. W. Klop, Combinatory Reduction Systems, 1980.

L. Liquori and B. 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

P. Melliès, Description Abstraite des Systèmes de Réécriture, 1996.

M. H. Newman, On Theories with a Combinatorial Definition of "Equivalence", Annals of Math, pp.223-243, 1942.
DOI : 10.2307/1968867

V. V. Oostrom, Confluence for Abstract and Higher-Order Rewriting, 1994.

F. Van-raamsdonk, Confluence and Normalisation of Higher-Order Rewriting, 1996.

F. Van-raamsdonk and P. Severi, On normalisation, Centrum voor Wiskunde en Informatica (CWI), p.33, 1995.

B. Wack, Klop counter example in the rho-calculus. Draft notes, 2003.