Z. M. Ariola and S. Blom, Cyclic lambda calculi, TACS '97: Third International Symposium on Theoretical Aspects of Computer Software, pp.77-106, 1997.
DOI : 10.1007/BFb0014548

Z. M. Ariola and S. Blom, Skew confluence and the lambda calculus with letrec, Annals of Pure and Applied Logic, vol.117, issue.1-3, pp.95-168, 2002.
DOI : 10.1016/S0168-0072(01)00104-X

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

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

E. Balland and P. Brauner, Term-graph Rewriting in Tom Using Relative Positions, TERMGRAPH'07: International Workshop on Computing with Terms and Graphs, 2007.
DOI : 10.1016/j.entcs.2008.03.030
URL : https://hal.archives-ouvertes.fr/inria-00129515

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

Z. Benaissa, P. Lescanne, and K. H. Rose, Modeling sharing and recursion for weak reduction strategies using explicit substitution, PLILP'96: Proceedings of the 8th International Symposium in Programming Languages: Implementations, Logics, and Programs, pp.393-407, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073599

A. Corradini and F. Drewes, (cyclic) term graph rewriting is adequate for rational parallel term rewriting, 1997.

A. Corradini and F. Gadducci, CPO models for infinite term rewriting, AMAST'95: Proceedings of the 4th International Conference in Algebraic Methodology and Software Technology, pp.368-384, 1995.
DOI : 10.1007/3-540-60043-4_65

A. Corradini and F. Gadducci, Rational term rewriting, FoSSaCS '98: Proceedings of the First International Conference on Foundations of Software Science and Computation Structure, pp.156-171, 1998.
DOI : 10.1007/BFb0053548

N. G. De-bruijn, Lambda calculus notation with nameless dummies. a tool for automatic formula manipulation with application to the church-rosser theorem, Indagationes Mathematicae, vol.34, pp.381-392, 1972.

D. J. Dougherty, P. Lescanne, and L. Liquori, Addressed term rewriting systems: application to a typed object calculus, Mathematical Structures in Computer Science, vol.16, issue.04, pp.667-709, 2006.
DOI : 10.1017/S096012950600541X
URL : https://hal.archives-ouvertes.fr/hal-01148846

R. Echahed and N. Peltier, Narrowing Data-Structures with Pointers, ICGT'06: Proceedings of the Third International Conference on Graph Transformations, pp.92-106, 2006.
DOI : 10.1007/11841883_8

B. Hoffmann and D. Plump, Implementing term rewriting by jungle evaluation, RAIRO: Theoretical Informatics and Applications, 1991.
DOI : 10.1051/ita/1991250504451
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5872

R. Kennaway, On ???on graph rewritings???, Theoretical Computer Science, vol.52, issue.1-2, pp.37-58, 1987.
DOI : 10.1016/0304-3975(87)90079-X

C. Kirchner, Strategic Rewriting, International Workshop on Reduction Strategies in Rewriting and Programming -WRS, 2004.
DOI : 10.1016/j.entcs.2004.11.017
URL : https://hal.archives-ouvertes.fr/inria-00107802

C. Kirchner and H. Kirchner, Rewriting, solving, proving. A preliminary version of a book is available at www, 1999.

M. Löwe, Algebraic approach to single-pushout graph transformation, Theoretical Computer Science, vol.109, issue.1-2, pp.181-224, 1993.
DOI : 10.1016/0304-3975(93)90068-5

D. Plump, Handbook of Graph Grammars and Computing by Graph Transformation , chapter Term graph rewriting, pp.3-61, 1999.

E. Visser, Stratego: A Language for Program Transformation Based on Rewriting Strategies System Description of Stratego 0.5, RTA'01: 12th International Conference on Rewriting Techniques and Applications, pp.357-361, 2001.
DOI : 10.1007/3-540-45127-7_27