Z. M. Ariola and J. W. Klop, Equational term graph rewriting, Fundamenta Informaticae, vol.26, issue.3-4, pp.207-240, 1996.

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

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

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

G. Barthe, H. Cirstea, C. Kirchner, and L. Liquori, Pure Pattern Type Systems, Proc. of POPL'03, pp.250-261, 2003.
DOI : 10.1145/604131.604152

C. Bertolissi, The graph rewriting calculus: proof of confluence and simulation of TGRs, 2005.

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

H. Cirstea, G. Faure, and C. Kirchner, A ?-calculus of explicit constraint application, Proc. of WRLA'04, pp.51-67, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00095626

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, L. Liquori, and B. Wack, Rewriting Calculus with Fixpoints: Untyped and First-Order Systems, Proc. of TYPES'03, pp.147-171, 2003.
DOI : 10.1007/978-3-540-24849-1_10
URL : https://hal.archives-ouvertes.fr/inria-00100113

A. Corradini, Term rewriting in CT?, Proc. of TAPSOFT'93, pp.468-484, 1993.

N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.1-2, pp.69-116, 1987.
DOI : 10.1016/S0747-7171(87)80022-6

J. Jouannaud and H. Kirchner, Completion of a set of rules modulo a set of equations, Proc. of POPL'84, pp.83-92, 1984.

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

E. Ohlebusch, Church-Rosser theorems for abstract reduction modulo an equivalence relation, Proc. of RTA'98, pp.17-31, 1998.
DOI : 10.1007/BFb0052358

G. Peterson and M. E. Stickel, Complete Sets of Reductions for Some Equational Theories, Journal of the ACM, vol.28, issue.2, pp.233-264, 1981.
DOI : 10.1145/322248.322251

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

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