P. Baillot and U. D. Lago, Higher-order interpretations and program complexity, Information and Computation, vol.248, pp.56-81, 2016.
DOI : 10.1016/j.ic.2015.12.008
URL : https://hal.archives-ouvertes.fr/hal-00798298

G. Bonfante, A. Cichon, and J. Marion, 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

R. L. Constable, Type two computational complexity, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.108-121, 1973.
DOI : 10.1145/800125.804041

A. Stephen, B. M. Cook, and . Kapron, Characterizations of the basic feasible functionals of finite type, Foundations of Computer Science, pp.154-159, 1989.

H. Férée, Complexité d'ordre supérieur et analyse récursive. (Higher order complexity and computable analysis), 2014.

R. J. Irwin, B. M. Kapron, and J. S. Royer, On characterizations of the basic feasible functionals (part II), 2002.

R. J. Irwin, J. S. Royer, and B. M. Kapron, On characterizations of the basic feasible functionals, Part I, Journal of Functional Programming, vol.11, issue.1, pp.117-153, 2001.
DOI : 10.1017/S0956796800003841

A. Kawamura and S. A. Cook, Complexity theory for operators in analysis, Proc. 42nd ACM Symposium on Theory of Computing, pp.495-502, 2010.
DOI : 10.1145/2189778.2189780
URL : http://arxiv.org/abs/1305.0453

A. William, B. Kirk, and . Sims, Handbook of metric fixed point theory, 2001.

K. Ko, Complexity Theory of Real Functions, Birkhäuser, 1991.
DOI : 10.1007/978-1-4684-6802-1

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

Z. Manna and S. Ness, On the termination of Markov algorithms, Third Hawaii International Conference on System Science, pp.789-792, 1970.

K. Mehlhorn, Polynomial and abstract subrecursive classes, Proc. 6th annual ACM Symposium on Theory of Computing, pp.96-109, 1974.
DOI : 10.1016/s0022-0000(76)80035-9
URL : http://doi.org/10.1016/s0022-0000(76)80035-9

R. Péchoux, Synthesis of sup-interpretations: A survey, Theoretical Computer Science, vol.467, pp.30-52, 2013.
DOI : 10.1016/j.tcs.2012.11.003

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

J. Van, Termination proofs for higher-order rewrite systems, International Workshop on Higher-Order Algebra, Logic, and Term Rewriting, pp.305-325, 1993.

G. Winskel, The formal semantics of programming languages: an introduction, 1993.