R. Amadio, Max-Plus Quasi-interpretations, TLCA. Lecture Notes in Computer Science, pp.31-45, 2003.
DOI : 10.1007/3-540-44904-3_3
URL : https://hal.archives-ouvertes.fr/hal-00146999

R. Amadio, S. Coupet-grimal, S. Dal-zilio, and L. Jakubiec, A Functional Scenario for Bytecode Verification of Resource Bounds, In CSL. Lecture Notes in Computer Science, vol.3210, pp.265-279, 2004.
DOI : 10.1007/978-3-540-30124-0_22
URL : https://hal.archives-ouvertes.fr/hal-00146991

R. Amadio and S. Dal-zilio, Resource Control for Synchronous Cooperative Threads, In CONCUR. Lecture Notes in Computer Science, vol.32, issue.4, pp.68-82, 2004.
DOI : 10.1007/3-540-46425-5_1
URL : https://hal.archives-ouvertes.fr/hal-00146983

H. Anderson and S. Khoo, Affine-Based Size-Change Termination, APLAS . Lecture Notes in Computer Science, vol.2895, pp.122-140, 2003.
DOI : 10.1007/978-3-540-40018-9_9

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

D. Aspinall and A. Compagnoni, Heap-Bounded Assembly Language, Journal of Automated Reasoning, vol.31, issue.3/4, pp.261-302, 2003.
DOI : 10.1023/B:JARS.0000021014.79255.33
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6038

J. Avery, Size-Change Termination and Bound Analysis, FLOPS. Lecture Notes in Computer Science, pp.192-207, 2006.
DOI : 10.1007/11737414_14

R. Bird and P. Wadler, Introduction to Functional Programming, 1988.

M. Blum, A Machine-Independent Theory of the Complexity of Recursive Functions, Journal of the ACM, vol.14, issue.2, pp.322-336, 1967.
DOI : 10.1145/321386.321395

G. Bonfante, J. Marion, and J. And-moyen, On Lexicographic Termination Ordering with Space Bound Certifications, In PSI. Lecture Notes in Computer Science, vol.2244, 2001.
DOI : 10.1007/3-540-45575-2_46
URL : https://hal.archives-ouvertes.fr/inria-00100523

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

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

M. Hofmann, Linear types and non-size-increasing polynomial time computation, LICS, pp.464-473, 1999.

M. Hofmann, A Type System for Bounded Space and Functional In-Place Update???Extended Abstract, In ESOP. Lecture Notes in Computer Science, vol.1782, pp.165-179, 2000.
DOI : 10.1007/3-540-46425-5_11

G. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM, vol.27, issue.4, pp.797-821, 1980.
DOI : 10.1145/322217.322230

N. Jones and L. Kristiansen, The flow of data and the complexity of algorithms. Lecture notes in computer science 3526, pp.263-274, 2005.

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

C. S. Lee, N. Jones, and A. Ben-amram, The Size-Change Principle for Program Termination, In POPL, vol.28, pp.81-92, 2001.

J. Marion, Analysing the implicit complexity of programs, Information and Computation, vol.183, issue.1, pp.2-18, 2003.
DOI : 10.1016/S0890-5401(03)00011-7
URL : https://hal.archives-ouvertes.fr/inria-00099505

J. Marion and J. Moyen, Efficient first order functional program interpreter with time bound certifications, LPAR. Lecture Notes in Computer Science, pp.25-42, 1955.
URL : https://hal.archives-ouvertes.fr/inria-00099178

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

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

W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.
DOI : 10.1016/S0022-0000(70)80006-X
URL : http://doi.org/10.1016/s0022-0000(70)80006-x

R. Thiemann and J. Giesl, The size-change principle and dependency pairs for termination of term rewriting, Applicable Algebra in Engineering, Communication and Computing, vol.25, issue.4, pp.229-270, 2005.
DOI : 10.1007/s00200-005-0179-7