N. Andersen and N. D. Jones, Generalizing Cook's transformation to imperative stack programs, Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science, pp.1-18, 1994.
DOI : 10.1007/3-540-58131-6_33

A. Asperti, The intensional content of rice's theorem, POPL, pp.113-119, 2008.

G. Bonfante, Observation of implicit complexity by non confluence, DICE, 2010.
DOI : 10.4204/EPTCS.23.2
URL : https://hal.archives-ouvertes.fr/inria-00535539

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

G. Bonfante, J. Marion, and R. Péchoux, Synthesis of quasi-interpretations, Logic and Complexity in Computer Science, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000660

A. K. Chandra, D. J. Ko?en, and L. J. Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

S. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, Journal of the ACM, vol.18, issue.1, pp.4-18, 1971.
DOI : 10.1145/321623.321625

S. Coupet-grimal and W. Delobel, An effective proof of the well-foundedness of the multiset path ordering, Applicable Algebra in Engineering, Communication and Computing, vol.43, issue.2, 2005.
DOI : 10.1007/s00200-006-0020-y

N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science, vol.17, issue.3, pp.279-301, 1982.
DOI : 10.1016/0304-3975(82)90026-3
URL : http://doi.org/10.1016/0304-3975(82)90026-3

N. Dershowitz and J. Jouannaud, Handbook of Theoretical Computer Science vol.B, chapter Rewrite systems, pp.243-320, 1990.

N. Hirokawa and G. Moser, Automated Complexity Analysis Based on the Dependency Pair Method, Lecture Notes in Computer Science, vol.5195, pp.364-379, 2008.
DOI : 10.1007/978-3-540-71070-7_32

N. Jones, LOGSPACE and PTIME characterized by programming languages, Theoretical Computer Science, vol.228, issue.1-2, pp.151-174, 1999.
DOI : 10.1016/S0304-3975(98)00357-0

S. Kamin and J. Lévy, Attempts for generalising the recursive path orderings, 1980.

D. Leivant and J. Marion, Ramified recurrence and computational complexity II: Substitution and poly-space, Computer Science Logic, 8th Workshop, CSL '94, pp.486-500, 1995.
DOI : 10.1007/BFb0022277

R. R. Péter and . Funktionen, English translation: Recursive Functions, Akadémiai Kiadó, 1966.