G. Bonfante, A. Cichon, J. Marion, and H. Touzet, Algorithms with polynomial interpretation termination proof, Journal of Functional Programming, vol.11, issue.1, pp.33-53, 2001.
DOI : 10.1017/S0956796800003877

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

G. Bonfante and Y. Guiraud, Programs as polygraphs: computability and complexity, Logical Methods in Computer Science, 2006.

A. Cichon and P. Lescanne, Polynomial interpretations and the complexity of algorithms, Lecture Notes in Artificial Intelligence, vol.607, pp.139-147, 1992.
DOI : 10.1007/3-540-55602-8_161

E. Grädel and Y. Gurevich, Abstract, The Journal of Symbolic Logic, vol.57, issue.03, pp.952-969, 1995.
DOI : 10.1016/0304-3975(92)90149-A

Y. Guiraud, Termination orders for three-dimensional rewriting, Journal of Pure and Applied Algebra, vol.207, issue.2, pp.341-371, 2006.
DOI : 10.1016/j.jpaa.2005.10.011

URL : http://doi.org/10.1016/j.jpaa.2005.10.011

Y. Lafont, Interaction nets, Principles of Programming Languages, pp.95-108, 1990.

Y. Lafont and F. Métayer, Polygraphic resolutions and homology of monoids, Journal of Pure and Applied Algebra, vol.213, issue.6, 2006.
DOI : 10.1016/j.jpaa.2008.10.005

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

D. Lankford, On proving term rewriting systems are noetherian, 1979.

F. Métayer, Resolutions by polygraphs, Theory and Applications of Categories, vol.11, pp.148-184, 2003.

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

. John-von-neumann, Theory of self-reproducing automata, 1966.