G. Bonfante, Some Programming Languages for Logspace and Ptime, 11th International Conference on Algebraic Methodology and Software Technology -AMAST'06, 2006.
DOI : 10.1007/11784180_8
URL : https://hal.archives-ouvertes.fr/inria-00105744

G. Bonfante, A. Cichon, J. Marion-&héì-ene, and . 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, J. Marion, and &. Moyen, Quasi-interpretations a way to control resources, Theoretical Computer Science, vol.412, issue.25, 2009.
DOI : 10.1016/j.tcs.2011.02.007
URL : https://hal.archives-ouvertes.fr/hal-00591862

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

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

M. Gaboardi, J. Marion, and &. Simona-ronchi-della-rocca, A logical account of pspace, ACM SIGPLAN Notices, vol.43, issue.1, pp.121-131, 2008.
DOI : 10.1145/1328897.1328456
URL : https://hal.archives-ouvertes.fr/hal-00342323

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

D. Hofbauer and &. Clemens-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

N. Jones, Computability and Complexity from a Programming Perspective, 1997.
DOI : 10.1007/978-94-010-0413-8_4

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 &. Lévy, Attempts for generalising the recursive path orderings, 1980.

W. Mark and . Krentel, The complexity of optimization problems, Journal of computer and system sciences 36, pp.490-519, 1988.

S. Mukkai, &. Krishnamoorthy, and . Paliath-narendran, On recursive path ordering, Theoretical Computer Science, vol.40, issue.2-3, pp.323-328, 1985.

L. Kristiansen, Complexity-Theoretic Hierarchies, CiE, Lecture Notes in Computer Science, vol.29, issue.12, pp.279-288, 2006.
DOI : 10.1090/S0002-9947-1963-0158822-2

L. Kristiansen and &. Mender, The Semantics and Complexity of Successor-free non deterministic Gödel T and PCF, Computability in Europe, CIE '09, 2009.

D. Plaisted, A recursively defined ordering for proving termination of term rewriting systems, 1978.

O. Shkaravska, M. Van-eekelen, and &. Ron-van-kesteren, Polynomial Size Analysis of First-Order Shapely Functions, Logical Methods in Computer Science, vol.5, issue.2, 2009.
DOI : 10.2168/LMCS-5(2:10)2009