M. Abadi, Cardelli ? A Theory of Objects, p.136, 1996.

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

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

B. and A. Borodin, Cook ? A time-space tradeoff for sorting on a general sequential model of computation, BC92] S. Bellantoni et S. Cook ? « A new recursion-theoretic characterization of the poly-time functions », Computational Complexity, pp.112-97, 1980.

. [. Bibliographie, A. Bonfante, J. Cichon, and . Marion, Touzet ? « Complexity classes and rewrite systems with polynomial interpretation », CSL'98, Ben01] R. Benzinger ? « Automated complexity analysis of Nuprl extracted programs, pp.372-384, 1999.

G. Bonfante, R. Kahle, and J. , Marion et I. Oitavem ? « Towards an implicit characterization of N C k », CSL'06 114 [Blo94] S. Bloch ? « Function-algebraic characterizations of log and polylog parallel time, Blu67] M. Blum ? « A machine-independent theory of the complexity of recursive functions Baillot et V. Mogbil ? « Soft lambda-calculus : a language for polynomial time computation, pp.175-205, 1967.

J. [. Bonfante and J. Marion, Moyen ? « On lexicographic termination ordering with space bound certifications », PSI, Lecture Notes in Computer Science Bonfante, J.Y. Marion et J.Y. Moyen ? « Quasi-interpretations Theoretical Computer Science, vol.2244, issue.74, pp.74-87, 2001.

G. Bonfante, J. Marion, J. Bonfante, and J. , Moyen et R. Péchoux ? « Synthesis of quasi-interpretations Marion et R. Péchoux ? « A characterization of alternating log time by first order functional programs, Logic and Complexity in Computer Science, LCC 2005, pp.38-90, 2005.

. [. Bibliographie and J. Bonfante, Marion et R. Péchoux ? « Quasi-interpretation synthesis by decomposition, Lecture Notes in Computer Science, vol.4711, issue.58, pp.49-70, 2007.

T. [. Baader, Nipkow ? Term rewriting and all that, p.14, 1998.

. [. Bird, Wadler ? Introduction to functional programming, Car56] R. Carnap ? Meaning and necessity, p.12, 1956.

R. [. Cousot and ?. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.77-238, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

C. A. Chandra, D. Kozen, L. Stockmeyer, ?. «-alternation, ]. K. Compton et al., 113 [Clo89] P. Clote ? « Sequential, machine-independent characterizations of the parallel complexity classes ALOGTIME, AC k , N C k and NC, Birkhäuser Computational models and function algebras », LCC'94 Leiserson et R. Rivest ? Introduction to Algorithms, pp.114-133, 1981.

E. Contejean, C. Marche, and B. , Monate et X. Urbain ? « Proving Termination of Rewriting with CiME 105 [Cob62] A. Cobham ? « The intrinsic computational difficulty of functions, Proceedings of the International Conference on Logic, pp.71-73, 1962.

J. [. Dershowitz and . Jouannaud, Rewrite Systems, [DZG05] S. Dal-Zilio et R. Gascon ? « Resource bound certification for a tailrecursive virtual machine », APLAS 2005, pp.243-320, 1990.
DOI : 10.1016/B978-0-444-88074-1.50011-1

M. Gaboardi, Ronchi Della Rocca ? « A soft type assignment system for ?-calculus », CSL, pp.4646-253, 2007.

P. [. Giesl and R. Schneider-kamp, Thiemann ? « AProVE 1.2 : Automatic termination proofs in the dependency pair framework, Theoretical Computer Science, vol.105, issue.97 1 8, pp.4130-281, 1992.

. Hue80, Huet ? « Confluent reductions : Abstract properties and applications to term rewriting systems, Journal of the ACM, vol.27, issue.4, pp.797-821, 1980.

B. [. Igarashi, P. Pierce, ?. Wadler, and G. ». Java, Featherweight Java: a minimal core calculus for Java and GJ, Jon97] N. D. Jones ? Computability and complexity, from a programming perspective, pp.396-450, 1997.
DOI : 10.1145/503502.503505

H. [. Kirchner, ?. Kirchner, . Rewriting-solving-provingkl80-]-s, J. Kamin, and ?. Lévy, Attempts for generalising the recursive path orderings Unpublished note, Krishnamoorthy et P. Narendran ? « On recursive path ordering, pp.14-15, 1980.

K. , L. Kristiansen, and K. H. , Niggl ? « On the computational complexity of imperative programming languages, Theoretical Computer Science, vol.318, issue.12 8, pp.139-161, 2004.

M. Kurihara, Modularity of simple termination of term rewriting systems with shared constructors, Lafont ? « Soft linear logic and polynomial time, pp.273-282, 1992.
DOI : 10.1016/0304-3975(92)90015-8

J. [. Leivant, Marion ? « Lambda calculus characterizations of poly-time », Fundamenta Informaticae 19, LM00] D. Leivant et J.-Y. Marion ? « A characterization of alternating log time by ramified recurrence, pp.167-178, 1993.

A. [. Liquori, ?. Spiwack, and . Feathertrait, A modest extension of featherweight java Accepted, to appear. 159 [Luc05] S. Lucas ? « Polynomials over the reals in proofs of termination : from theory to practice, Theoretical Informatics and Applications, pp.547-586, 2005.

. [. Manna, Ness ? « On the termination of Markov algorithms, Moyen ? « Analyse de la complexité et transformation de programmes Thèse d'université, pp.789-792, 1970.

]. J. Mp07b, Marion et R. Péchoux ? « A characterization of polynomial complexity classes using dependency pairs, 2007.

. [. Niggl, Wunderlich ? « Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs, Pap94] C. H. Papadimitriou ? Computational complexity, pp.1122-155, 1994.

]. M. Bibliographie-[-rao95, Krishna Rao ? « Modular proofs of completeness of hierarchical term rewriting systems, Rey98] J.C. Reynolds ? « Definitional Interpreters for Higher-Order Programming Languages », Higher-Order and Symbolic Computation, pp.487-512, 1995.

J. [. Thiemann, ?. Giesl, and . Size, 107 [Toy87a] Y. Toyama ? « Counterexamples for the direct sum of term rewriting systems On the church-rosser property for the direct sum of term rewriting systems, Tur36] A. M. Turing ? « On computable numbers with an application to the entscheidungsproblem », Proc, pp.141-143, 1936.

R. Définition-de, 27 I.5 ´ Evaluation d'un programmè a l'aide d'un interpréteur avec cache, p.29

.. Génération-de-contraintes-sur-les-projecteurs, 98 II.4 SCP graphe du programme minus, p.110