P. Baillot and U. Dal-lago, Higher-order interpretations and program complexity, Computer Science Logic (CSL'12), vol.16, pp.62-76, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01337728

P. Baillot and U. Dal-lago, Higher-order interpretations and program complexity, Inf. Comput, vol.248, pp.56-81, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01337728

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

A. Cichon and P. Lescanne, Polynomial interpretations and the complexity of algorithms, In Journal of Automated Reasoning, vol.34, issue.4, pp.325-363, 2005.

E. Contejean, C. Marché, A. P. Tomás, and X. Urbain, Higher-order interpretations and program complexity, International Conference on Automated Deduction, pp.139-147, 1992.

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

R. L. Constable, Type two computational complexity, Proc. 5th annual ACM Symposium on Theory of Computing, pp.108-121, 1973.

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

H. Férée, E. Hainry, M. Hoyrup, and R. Péchoux, Characterizing polynomial time complexity of stream programs using interpretations In Theor, Comput. Sci, vol.585, pp.41-54, 2015.

E. Hainry and R. Péchoux, Higher order interpretation for higher order complexity, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pp.269-285, 2017.

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.

A. Kawamura and S. A. Cook, Complexity theory for operators in analysis, Proc. 42nd ACM Symposium on Theory of Computing, pp.495-502, 2010.

-. Ker and . Ko, Complexity Theory of Real Functions. Birkhäuser, 1991.

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

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

K. Mehlhorn, Polynomial and abstract subrecursive classes, Proc. 6th annual ACM Symposium on Theory of Computing, pp.96-109, 1974.

J. C. Mitchell, Foundations for programming languages, 1996.

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

R. Péchoux, Synthesis of sup-interpretations: A survey, Theor. Comput. Sci, vol.467, pp.30-52, 2013.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.

J. Van-de-pol, Termination proofs for higher-order rewrite systems, Logic, and Term Rewriting, vol.816, pp.305-325, 1993.

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