S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, CoRR abs/1311, 2013.
DOI : 10.1006/inco.2000.2930

[. Berry and P. Curien, Sequential algorithms on concrete data structures, Theoretical Computer Science, vol.20, issue.3, pp.265-321, 1982.
DOI : 10.1016/S0304-3975(82)80002-9

[. Bellantoni and S. A. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992.
DOI : 10.1007/BF01201998

[. Bellantoni, Comments On Two Notions of Higher Type Computability, Dans : Unpublished notes, vol.109, p.71, 1990.

[. Bournez, D. S. Graça, and A. Pouly, Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains, MFCS. Édité par Filip Murlak et Piotr Sankowski. Tome 6907, pp.170-181, 2011.
DOI : 10.1007/978-3-642-22993-0_18

URL : https://hal.archives-ouvertes.fr/hal-00760919

[. Bournez, D. S. Graça, and A. Pouly, On the complexity of solving initial value problems, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.115-121, 2012.
DOI : 10.1145/2442829.2442849

URL : https://hal.archives-ouvertes.fr/hal-00760742

[. Bournez, D. S. Graça, and A. Pouly, Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer, Lecture Notes in Computer Science, pp.169-180, 2013.
DOI : 10.1007/978-3-642-38236-9_16

[. Bournez and E. Hainry, Elementarily computable functions over the real numbers and -sub-recursive functions, Theoretical Computer Science Automata, Languages and Programming : Algorithms and Complexity, vol.34823, pp.130-147, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00107812

[. Baillot and D. Mazza, Linear logic by levels and bounded time complexity, Theoretical Computer Science 411, pp.470-503, 2010.
DOI : 10.1016/j.tcs.2009.09.015

URL : https://hal.archives-ouvertes.fr/hal-00488531

G. Bonfante, J. Marion, and J. Moyen, Quasiinterpretation : a way to control ressources. Rapport technique, p.35, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00001257

[. Bournez, M. L. Campagnolo, D. S. Graça, and E. Hainry, Polynomial differential equations compute all real computable functions on computable compact intervals, Journal of Complexity, vol.23, issue.3, pp.317-335, 2007.
DOI : 10.1016/j.jco.2006.12.005

URL : https://hal.archives-ouvertes.fr/inria-00102947

L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers : NP-completeness, recursive functions and universal machines, pp.1-46, 1989.

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

A. Cobham, The Intrinsic Computational Difficulty of Functions, pp.24-25, 1965.

[. Cook and A. Urquhart, Functional interpretations of feasibly constructive arithmetic, Annals of Pure and Applied Logic 63, pp.103-200, 1993.

P. Curien, Sequential Algorithms Categorical Combinators , Sequential Algorithms, and Functional Programming, Birkhäuser Boston Chapitre Progress in Theoretical Computer Science, pp.159-250, 1993.
DOI : 10.1007/978-1-4612-0317-9

U. Dal, L. , and S. Martini, Derivational Complexity Is an Invariant Cost Model " . Dans : Foundational and Practical Aspects of Resource Analysis

[. Danner, J. Paykin, and J. S. Royer, A static cost analysis for a higher-order language, Proceedings of the 7th workshop on Programming languages meets program verification, PLPV '13, pp.25-34, 2013.
DOI : 10.1145/2428116.2428123

[. Danner and J. S. Royer, Adventures in time and space, Computer Science, vol.31, 2007.

H. Férée, E. Hainry, M. Hoyrup, and R. Péchoux, Interpretation of Stream Programs : Characterizing Type 2 Polynomial Time Complexity, Édité par Otfried Cheong Lecture Notes in Computer Science Chapitre Lecture Notes in Computer Science, pp.291-303, 2010.

H. Férée, E. Hainry, M. Hoyrup, and R. Péchoux, Characterizing polynomial time complexity of stream programs using interpretations, Theoretical Computer Science, vol.4, p.1, 2014.

H. Férée, W. Gomaa, and M. Hoyrup, Analytical properties of resource-bounded real functionals, Journal of Complexity, vol.305, pp.647-671, 2014.

H. Férée and M. Hoyrup, Higher-order complexity in analysis, CCA 2013 : Computability and Complexity in Analysis, p.4, 2013.

H. Férée, M. Hoyrup, and W. Gomaa, On the Query Complexity of Real Functionals, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.103-112, 2013.
DOI : 10.1109/LICS.2013.15

H. Friedman, The Computational Complexity of Maximization and Integration Advances in Math, pp.80-98, 1984.

J. Murdoch, V. Gabbay, and . Ciancia, Freshness and namerestriction in sets of traces with names Tome 6604, Foundations of software science and computation structures, 14th International Conference, pp.365-380, 2011.

J. Murdoch, D. R. Gabbay, and . Ghica, Game Semantics in the Nominal Model, pp.173-189, 2012.

O. Gh77-]-robin, J. M. Gandy, and E. Hyland, Computable and recursively countable functions of higher type, Studies in Logic and the Foundations of Mathematics, pp.407-438, 1977.

D. R. Ghica, Slot games : a quantitative model of computation, POPL. Édité par Jens Palsberg et Martín Abadi. Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.85-97, 2005.

D. R. Ghica, Applications of Game Semantics: From Program Analysis to Hardware Synthesis, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.11-14, 2009.
DOI : 10.1109/LICS.2009.26

J. Girard, Light linear logic, pp.145-176, 1998.

[. Harmer, M. Hyland, and P. Melliès, Categorical Combinatorics for Innocent Strategies, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.379-388, 2007.
DOI : 10.1109/LICS.2007.14

URL : https://hal.archives-ouvertes.fr/hal-00150373

J. Martin, . Elliott, C. Hyland, and . Ong, On Full Abstraction for PCF : I, II, and III, Inf. Comput, vol.1632, issue.106, pp.285-408, 2000.

J. M. and E. Hyland, The intrinsic recursion theory on the countable or continuous functionals Generalized Recursion Theory II Proceedings of the 1977 Oslo Symposium, Chapitre Studies in Logic and the Foundations of Mathematics, pp.135-145, 1978.

R. J. Irwin, J. S. Royer, M. Bruce, and . 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

R. J. Irwin, J. S. Royer, M. Bruce, and . Kapron, On Characterizations of the Basic Feasible Functionals (Part II) " . Unpublished, pp.72-79, 2002.

[. Ignjatovic and A. Sharma, Some applications of logic to feasibility in higher types, ACM Transactions on Computational Logic, vol.5, issue.2, pp.332-350, 2004.
DOI : 10.1145/976706.976713

[. Kawamura, N. Th, C. Müller, M. Rösnick, and . Ziegler, Parameterized Uniform Complexity in Numerics : from Smooth to Analytic, from NP-hard to Polytime, Computing Research Repository abs, p.4974, 1211.

[. Kawamura, H. Ota, C. Rösnick, and M. Ziegler, Computational Complexity of Smooth Differential Equations, MFCS. Édité par Branislav Rovan Lecture Notes in Computer Science, pp.578-589, 2012.

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

M. Bruce, S. A. Kapron, and . Cook, A New Characterization of Type- 2 Feasibility, Dans : SIAM Journal on Computing, vol.251, issue.103, pp.117-132, 1996.

A. S. Kechris, Classical Descriptive Set Theory, 1995.
DOI : 10.1007/978-1-4612-4190-4

[. Ko and H. Friedman, Computational Complexity of Real Functions, Theoretical Computer Science, vol.203, pp.323-352, 1982.

. Stephen-cole-kleene, Countable functionals, Constructivity in Mathematics, pp.81-100, 1959.

. Stephen-cole-kleene, Recursive functionals and quantifiers of finite types I, pp.1-52, 1959.

. Stephen-cole-kleene, Recursive functionals and quantifiers of finite types II, pp.106-142, 1963.

[. Ko, The maximum value problem and NP real numbers, Journal of Computer and System Sciences, vol.24, issue.1, pp.15-35, 1982.
DOI : 10.1016/0022-0000(82)90053-8

[. Ko, Complexity Theory of Real Functions
DOI : 10.1007/978-1-4684-6802-1

G. Kreisel, Interpretation of analysis by means of constructive functionals of finite types, Constructivity in Mathematics. Édité par A. Heyting. Studies in Logic and the Foundations of Mathematics . Proc. Colloq, pp.101-128, 1957.

Y. Lafont, Soft linear logic and polynomial time, Implicit Computational Complexity, pp.163-180, 2004.
DOI : 10.1016/j.tcs.2003.10.018

URL : http://doi.org/10.1016/j.tcs.2003.10.018

D. Leivant, Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time, pp.320-343, 1995.
DOI : 10.1007/978-1-4612-2566-9_11

U. Dal, L. , and O. Laurent, Quantitative Game Semantics for Linear Logic Tome 5213, Lecture Notes in Computer Science, pp.230-245, 2008.

[. Leivant and J. Marion, Lambda calculus characterizations of poly-time " . Dans : Typed Lambda Calculi and Applications, pp.274-288, 1993.

R. John and . Longley, Notions of computability at higher types I " . Dans : Logic Colloquium, pp.32-142, 2000.

K. Mehlhorn, Polynomial and abstract subrecursive classes, Journal of Computer and System Sciences, vol.12, issue.2, pp.147-178, 1976.
DOI : 10.1016/S0022-0000(76)80035-9

URL : http://doi.org/10.1016/s0022-0000(76)80035-9

A. S. Murawski, Games for complexity of second-order call-byname programs, Theoretical Computer Science, vol.343, pp.1-2, 2005.

[. Nickau, Angenommen Vom Fachbereich et al. Hereditarily Sequential Functionals : A Game-Theoretic Approach to Sequentiality, Doktors Der Naturwissenschaften, Dipl. ?math Hanno Nickau, vol.105, p.76, 1996.

H. Nickau, Hereditarily sequential functionals, Logical Foundations of Computer Science. Édité par Anil Nerode et Yu. V. Matiyasevich . Tome Chapitre Lecture Notes in Computer Science, vol.813, issue.106, pp.253-264, 1994.
DOI : 10.1007/3-540-58140-5_25

D. Normann, The countable functionals " . Dans : Recursion on the Countable Functionals. Tome 811, Chapitre Lecture Notes in Mathematics, pp.23-48, 1980.

]. G. Plo77 and . Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol.53, pp.223-255, 1977.

W. Rudin, Functional analysis. Second. International Series in Pure and Applied Mathematics, p.424, 1991.

[. Sands, Complexity Analysis for a Lazy Higher-Order Language, Lecture Notes in Computer Science, pp.361-376, 1990.

]. V. Saz76, . Yu, and . Sazonov, Degrees of parallelism in computations, Mathematical Foundations of Computer Science, pp.517-523, 1976.

D. S. Scott, A type-theoretical alternative to ISWIM, CUCH, OWHY, Theoretical Computer Science, vol.121, issue.1-2, pp.411-440, 1993.
DOI : 10.1016/0304-3975(93)90095-B

A. Seth, Some desirable conditions for feasible functionals of type 2, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.320-331, 1993.
DOI : 10.1109/LICS.1993.287576

A. Seth, Complexity theory of higher type functionals, 1994.

A. Seth, Turing Machine Characterizations of Feasible Functionals of All Finite Types, Feasible Mathematics II, pp.407-428, 1995.
DOI : 10.1007/978-1-4612-2566-9_14

C. E. Shannon, Mathematical Theory of the Differential Analyzer, Journal of Mathematics and Physics, vol.XXII, issue.1-4, pp.337-354, 1941.
DOI : 10.1002/sapm1941201337

A. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.42-230, 1936.

[. Weihrauch, Computable Analysis, pp.24-59, 2000.