D. Aspinall, L. Beringer, M. Hofmann, H. Loidl, and A. Momigliano, A program logic for resources, Theoretical Computer Science, vol.389, issue.3, pp.411-445, 2007.
DOI : 10.1016/j.tcs.2007.09.003

J. L. Balcázar, J. Díaz, and J. Gabarró, Structural complexity II, EATCS Monographs of Theoretical Computer Science, vol.22, 1990.
DOI : 10.1007/978-3-642-75357-2

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

S. Bellantoni and I. Oitavem, Separating NC along the ?? axis, Theoretical Computer Science, vol.318, issue.1-2, pp.57-78, 2004.
DOI : 10.1016/j.tcs.2003.10.021

G. Bonfante, R. Kahle, J. Marion, and I. Oitavem, Towards an Implicit Characterization of NC k, Computer Science Logic '06, pp.212-224, 2006.
DOI : 10.1007/11874683_14

G. Bonfante, J. Marion, and R. Péchoux, A Characterization of Alternating Log Time by First Order Functional Programs, LPAR, pp.90-104, 2006.
DOI : 10.1007/11916277_7

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

A. K. Chandra, D. J. Ko?en, and L. J. Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

L. Kristiansen and N. D. Jones, The Flow of Data and the Complexity of Algorithms, CiE, pp.263-274, 2005.
DOI : 10.1007/11494645_33

D. Leivant, A foundational delineation of computational feasiblity, Proceedings of the Sixth IEEE Symposium on Logic in Computer Science (LICS'91), 1991.

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, A characterization of NC by tree recurrence, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.716-724, 1998.
DOI : 10.1109/SFCS.1998.743522

D. Leivant and J. Marion, A characterization of alternating log time by ramified recurrence, Theoretical Computer Science, vol.236, issue.1-2, pp.192-208, 2000.
DOI : 10.1016/S0304-3975(99)00209-1

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

J. Marion, Predicative Analysis of Feasibility and Diagonalization, TLCA, 2007.
DOI : 10.1007/978-3-540-73228-0_21

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

K. Niggl and H. Wunderlich, Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs, SIAM Journal on Computing, vol.35, issue.5, pp.1122-1147, 2006.
DOI : 10.1137/S0097539704445597

I. Oitavem, CharacterizingNC with tier 0 pointers, MLQ, vol.50, issue.1, pp.9-17, 2004.
DOI : 10.1002/malq.200310070

W. L. Ruzzo, On uniform circuit complexity, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.365-383, 1981.
DOI : 10.1109/SFCS.1979.31

URL : http://dx.doi.org/10.1016/0022-0000(81)90038-6

H. Simmons, The realm of primitive recursion, Archive for Mathematical Logic, vol.17, issue.2, pp.177-188, 1988.
DOI : 10.1007/BF01620765