C. Adams, The knot book, 2004.

T. Arts and J. Giesl, Termination of term rewriting using dependency pairs, Theoretical Computer Science, vol.236, issue.1-2, pp.133-178, 2000.
DOI : 10.1016/S0304-3975(99)00207-8

F. Baader and T. Nipkow, Term rewriting and all that, 1998.

J. Baez and A. Lauda, A history of n-categorical physics, draft version, 2006.

P. Baillot and K. Terui, Light types for polynomial time computation in lambda-calculus, Proceedings of the 19th Symposium on Logic in Computer Science (LICS 04), pp.266-275, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00012752

S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992.
DOI : 10.1007/BF01201998

G. Bonfante, A. Cichon, J. Marion, and H. Touzet, Complexity Classes and Rewrite Systems with Polynomial Interpretation, Proceedings of the 12th International Workshop on Computer Science Logic (CSL 98), pp.372-384, 1999.
DOI : 10.1007/10703163_25
URL : https://hal.archives-ouvertes.fr/inria-00098689

G. Bonfante and Y. Guiraud, Intensional Properties of Polygraphs, Proceedings of the 4th International Workshop on Term Graph Rewriting (TERMGRAPH 07), pp.65-77, 2008.
DOI : 10.1016/j.entcs.2008.03.034
URL : https://hal.archives-ouvertes.fr/inria-00129391

G. Bonfante, J. Marion, and J. Moyen, Quasi-interpretations a way to control resources, Theoretical Computer Science, vol.412, issue.25, 2005.
DOI : 10.1016/j.tcs.2011.02.007
URL : https://hal.archives-ouvertes.fr/hal-00591862

A. Burroni, Higher-dimensional word problems with applications to equational logic, Theoretical Computer Science, vol.115, issue.1, pp.43-62, 1993.
DOI : 10.1016/0304-3975(93)90054-W

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

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

J. Girard, Light Linear Logic, Information and Computation, vol.143, issue.2, pp.175-204, 1998.
DOI : 10.1006/inco.1998.2700

Y. Guiraud, Présentations d'opérades et systèmes de réécriture, 2004.

D. Hofbauer and C. Lautemann, Termination proofs and the length of derivations, Lecture Notes in Computer Science, vol.355, pp.167-177, 1988.
DOI : 10.1007/3-540-51081-8_107

M. Hofmann, A type system for bounded space and functional in-place update, Nordic Journal of Computing, vol.7, issue.4, pp.258-289, 2000.

N. Jones, Computability and complexity, from a programming perspective Logspace and ptime characterized by programming languages, Theroretical Computer Science, vol.25, issue.228, pp.151-174, 1997.

Y. Lafont, Interaction nets, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.95-108, 1990.
DOI : 10.1145/96709.96718

J. Lambek and P. Scott, Introduction to higher-order categorical logic, 1986.

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

D. Leivant, A foundational delineation of computational feasability, Proceedings of the 6th Symposium on Logic in Computer Science (LICS 91), pp.2-11, 1991.

D. Leivant and J. Marion, Lambda calculus characterizations of poly-time, Fundamenta Informaticae, vol.19, issue.12, pp.167-184, 1993.
DOI : 10.1007/BFb0037112

J. Loday, Generalized bialgebras and triples of operads, preprint, 2006.

P. Malbos, For string rewriting systems the homotopical and homological finiteness conditions coincide , preprint, 2007.

J. Marion and R. Péchoux, Resource Analysis by Sup-interpretation, Lecture Notes in Computer Science, vol.3945, pp.163-176, 2006.
DOI : 10.1007/11737414_12
URL : https://hal.archives-ouvertes.fr/inria-00000661

Y. Moschovakis, What is an algorithm? Mathematics Unlimited ?, pp.919-936, 2001.

M. Nielsen and I. Chuang, Quantum computation and quantum information, 2000.

K. Niggl and H. Wunderlich, Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs, SIAM Journal on Computing, vol.35, issue.5, pp.1122-1147, 2006.
DOI : 10.1137/S0097539704445597

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

C. Squier, A finiteness condition for rewriting systems, Theoretical Computer Science, vol.131, issue.2, pp.271-294, 1994.
DOI : 10.1016/0304-3975(94)90175-9

R. Street, The algebra of oriented simplexes, Journal of Pure and Applied Algebra, vol.49, issue.3, pp.149-181, 1976.
DOI : 10.1016/0022-4049(87)90137-X

A. Tarski, A Decision Method for Elementary Algebra and Geometry, 1951.
DOI : 10.1007/978-3-7091-9459-1_3

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