.. Graphes-d-'exécution, 127 Finitude d'un graphe d'exécution, p.128

A. Traduction, 130 Traduction d'un programme en forme normale, p.130

. Si-t-=-f-t-1, t ? où f ? F ? (L) avec ? > 0 et t 1, t ? ? T erm(L) Alors Sub(t) = def {t} ? 1?i?? Sub

P. Andary, B. Patrou, and &. , Valarcher ? « A theorem of representation for primitive recursive algorithms, Fundamenta Informaticae XX, vol.10, issue.85, pp.1-18, 2010.

. Ars91, Arsac ? « Algorithmique et langages de programmation », Bulletin de l'EPI, pp.115-124, 1991.

N. [. Ben-amram and &. J. Christensen, Simonsen ? « Computational models with no linear speedup, Chicago Journal of Theoretical Computer Science, issue.7, pp.1-24, 2012.

T. Biedl, J. F. Buss, E. D. Demaine, M. L. Demaine, M. Hajiaghayi et al., Palindrome recognition using a multidimensional tape, Theoretical Computer Science, vol.302, issue.1-3, pp.475-480, 2004.
DOI : 10.1016/S0304-3975(03)00086-0

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

A. Blass, N. Dershowitz, and &. , Gurevich ? « When are two algorithms the same ?, Why sets ? », Bullettin of the European Association for Theoretical Computer Science, pp.145-168, 2002.

P. Baillot and M. Gaboardi, Mogbil ? « A polytime functional language from light linear logic, Programming Languages and Systems, vol.6012, pp.104-124, 2010.

&. [. Cégielski, Normalization of Some Extended Abstract State Machines, Lecture Notes in Computer Science, vol.6300, pp.165-180, 2010.
DOI : 10.1007/978-3-642-15025-8_9

R. Cori and &. , Lascar ? Logique mathématique ? calcul propositionnel, algèbre de boole, calcul des prédicats, Masson éd, vol.1, issue.21, pp.15-117, 2003.

R. David and ?. , On the asymptotic behaviour of primitive recursive algorithms, Theoretical Computer Science, vol.266, issue.1-2, pp.159-193, 2001.
DOI : 10.1016/S0304-3975(00)00165-1
URL : https://hal.archives-ouvertes.fr/hal-00384689

M. Ferbus-zanda and &. , Grigorieff ? « Asm and operational algorithmic completeness of lambda calculus, Computation, vol.35, p.89, 2010.

U. Glaesser, Y. Gurevich, and &. , Veanes ? « Universal plug and play machine models, 2001.

]. M. Gla67, Gladstone ? « A reduction of the recursion scheme, The Journal of Symbolic Logic, vol.32, issue.4 7, 1967.

&. [. Gurevich, Spielmann ? « Recursive abstract state machines, Sequential abstract state machines capture sequential algorithms Interactive algorithms, pp.233-246, 1997.

&. [. Grigorieff, Valarcher ? « Evolving multialgebras unify all usual sequential computation models Classes of algorithms : Formalization and comparison, Symposium on Theoretical Aspects of Computer ScienceJon99] N. D. Jones ? « LOGSPACE and PTIME characterized by programming languages, pp.417-428, 1999.

D. E. Knuth and ?. Surreal-numbers, How two ex-students turned on to pure mathematics and found total happiness : A mathematical novelette, 1974.

&. [. Meyer and ?. Ritchie, The complexity of loop programs Valarcher ? « A total functional programming language that computes primitive recursive algorithms, Neergaard ? « Ploop : A language for polynomial time, pp.465-469, 1967.

E. Complexité-en, 74 en temps, p.33