A. Blass and Y. Gurevich, Abstract, The Journal of Symbolic Logic, vol.70, issue.03, pp.1264-1310, 2000.
DOI : 10.2307/2586700

S. Bellantoni, Predicative recursion and the polytime hiearchy, Feasible Mathematics II, Perspectives in Computer Science. Birkhaüser, 1994.

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

L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, 1998.
DOI : 10.1007/978-1-4612-0701-6

O. Bournez, F. Cucker, P. Jacobé-de-naurois, and J. Marion, Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time, Foundations of Software Science and Computational Structures, 6th International Conference (FOSSACS'2003), volume 2620 of Lecture Notes in Computer Science, pp.185-199, 2003.
DOI : 10.1007/3-540-36576-1_12
URL : https://hal.archives-ouvertes.fr/inria-00099618

P. Clote, Computation models and function algebras, Lect. Notes in Comp. Sci, vol.960, issue.94, pp.98-130, 1995.
DOI : 10.1007/3-540-60178-3_81
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.9652

F. Cucker, On the Complexity of Quantifier Elimination: the Structural Approach, The Computer Journal, vol.36, issue.5, pp.400-408, 1993.
DOI : 10.1093/comjnl/36.5.400

F. Cucker and K. Meer, Abstract, The Journal of Symbolic Logic, vol.4, issue.01, pp.363-390, 1999.
DOI : 10.2307/2586770

H. Ebbinghaus and J. Flum, Finite Model Theory. Perspectives in Mathematical Logic, 1995.

R. Fagin, Generalized first order spectra and polynomial time recognizable sets, Complexity of Computation, pp.43-73, 1974.

E. Grädel and Y. Gurevich, Abstract, The Journal of Symbolic Logic, vol.57, issue.03, pp.952-969, 1995.
DOI : 10.1016/0304-3975(92)90149-A

E. Grädel and K. Meer, Descriptive complexity theory over the real numbers, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.315-324, 1995.
DOI : 10.1145/225058.225151

Y. Gurevich, Algebras of feasible functions, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp.210-214, 1983.
DOI : 10.1109/SFCS.1983.5

Y. Gurevich and E. Grädel, Tailoring recursion for complexity, Journal for Symbolic Logic, vol.60, pp.952-969, 1995.

M. Hofmann, Type systems for polynomial-time computation, 1999.

N. Immerman, Descriptive Complexity, 1999.
DOI : 10.1007/978-1-4612-0539-5

N. Jones, The expressive power of higher-order types or, life without CONS, Journal of Functional Programming, vol.11, issue.1, pp.55-94, 2001.
DOI : 10.1017/S0956796800003889

D. Leivant, Predicative recurrence and computational complexity I: Word recurrence and poly-time, Feasible Mathematics II, pp.320-343, 1994.
DOI : 10.1007/978-1-4612-2566-9_11

D. Leivant and J. Marion, Lambda calculus characterizations of poly-time, Fundamenta Informaticae, vol.19184, issue.12, p.167, 1993.
DOI : 10.1007/BFb0037112

D. Leivant and J. Marion, Ramified recurrence and computational complexity II: Substitution and poly-space, Computer Science Logic, 8th Workshop, CSL'94, pp.369-380, 1995.
DOI : 10.1007/BFb0022277

J. Marion and J. Moyen, Efficient first order functional program interpreter with time bound certifications, LPAR, volume 1955 of Lect. Notes in Comp. Sci, pp.25-42, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00099178

B. Poizat, Les Petits Cailloux, Aléas, 1995.

V. Sazonov, Polynomial computability and recursivity in finite domains, Elektronische Informationsverarbeitung und Kybernetik, vol.7, pp.319-323, 1980.