C. Calude-]-calude, Theories of computational complexity, 1988.

L. Colson, About primitive recursive algorithms, Theoretical Computer Science, vol.83, issue.1, pp.57-69, 1991.
DOI : 10.1016/0304-3975(91)90039-5

. Colson, L. Fredholm-]-colson, and D. Fredholm, System T, call-by-value and the minimum problem, Theoretical Computer Science, vol.206, issue.1-2, pp.301-315, 1998.
DOI : 10.1016/S0304-3975(98)00011-5

URL : http://doi.org/10.1016/s0304-3975(98)00011-5

. Crolard, On the Expressive Power of the Loop Language, Nordic Journal of Computing, vol.13, issue.12, pp.46-57, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00083374

W. Davis, M. Davis, and E. Weyuker, Computability, Complexity and Languages, 1983.

J. E. Donahue, Locations considered unnecessary, Acta Informatica, vol.8, issue.3, pp.221-242, 1977.
DOI : 10.1007/BF00264468

F. Felleisen and D. P. Friedman, A calculus for assignments in higher-order languages, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, p.314, 1987.
DOI : 10.1145/41625.41654

A. Filinski, Representing monads, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, pp.446-457, 1994.
DOI : 10.1145/174675.178047

J. Filliâtre, Verification of non-functional programs using interpretations in type theory, Journal of functional Programming, vol.13, issue.4, pp.709-745, 2003.
DOI : 10.1017/S095679680200446X

M. Filliâtre, J. Filliâtre, and C. Marché, Multi-prover Verification of C Programs, Formal Methods and Software Engineering, 6th International Conference on Formal Engineering Methods, pp.15-29, 2004.
DOI : 10.1007/978-3-540-30482-1_10

. Gellerich, . Plödereder, W. Gellerich, and E. Plödereder, Parameter-Induced Aliasing in Ada, Reliable Software Technologies: Ada Europe 6th Ade-Europe International Conference Proceedings , volume 2043 of Lecture Notes in Computer Science, pp.88-99, 2001.
DOI : 10.1007/3-540-45136-6_6

. Gifford, . Lucassen, D. Gifford, and J. Lucassen, Integrating functional and imperative programming, Proceedings of the 1986 ACM conference on LISP and functional programming , LFP '86, 1986.
DOI : 10.1145/319838.319848

K. Gödel, ??BER EINE BISHER NOCH NICHT BEN??TZTE ERWEITERUNG DES FINITEN STANDPUNKTES, Dialectica, vol.12, issue.3-4, pp.280-287, 1958.
DOI : 10.1111/j.1746-8361.1958.tb01464.x

K. Gödel, Collected Works, 1990.

D. Hatcliff, J. Hatcliff, and O. Danvy, Thunks and the lambda-Calculus, BRICS Report Series, vol.3, issue.19, pp.303-319, 1997.
DOI : 10.7146/brics.v3i19.19981

N. D. Jones, Computability and Complexity from a Programming Perspective, 1997.
DOI : 10.1007/978-94-010-0413-8_4

G. Kahn, Natural semantics, Proc. Symposium on Theoretical Aspects of Computer Science (STACS), pp.22-39, 1987.
DOI : 10.1007/BFb0039592

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

. Kelsey, Revised 5 report on the algorithmic language Scheme, Higher-Order and Symbolic Computation, pp.7-105, 1998.

G. Kreisel, On the interpretation of non-finitist proofs -part I, J. Symb. Log, vol.16, issue.4, pp.241-267, 1951.

P. J. Landin, The Mechanical Evaluation of Expressions, The Computer Journal, vol.6, issue.4, pp.308-320, 1964.
DOI : 10.1093/comjnl/6.4.308

J. Mccarthy, Recursive functions symbolic expressions and their computation by machine, Part I, Communications of the ACM, vol.3, issue.4, pp.184-195, 1960.
DOI : 10.1145/367177.367199

R. Meyer, A. R. Meyer, and D. M. Ritchie, The complexity of loop programs, Proceedings of the 1967 22nd national conference on -, 1976.
DOI : 10.1145/800196.806014

. Milner, The Definition of Standard ML, 1997.

E. Moggi, Notions of computation and monads, Information and Computation, vol.93, issue.1, pp.55-92, 1991.
DOI : 10.1016/0890-5401(91)90052-4

P. W. O-'hearn and R. D. Tennent, Algol-like Languages, 1997.

R. Peter, Recursive Functions, 1968.

G. Plotkin, A structural approach to operational semantics, 1981.

J. C. Reynolds, Syntactic control of interference, POPL, pp.39-46, 1978.

J. C. Reynolds, The Essence of Algol, Algorithmic Languages, pp.345-372, 1981.
DOI : 10.1007/978-1-4612-4118-8_4

J. C. Reynolds, Theories of programming languages, 1998.
DOI : 10.1017/CBO9780511626364

D. A. Schmidt, The Structure of Typed Programming Languages, 1994.

K. Schütte, Proof theory, 1967.

J. Stoy, Denotational Semantics of Programming Languages: The Scott-Strachey Approach to Programming Language Theory, 1977.

J. Talpin, J. Talpin, and P. Jouvelot, The Type and Effect Discipline, Information and Computation, vol.111, issue.2, pp.245-296, 1994.
DOI : 10.1006/inco.1994.1046

D. A. Turner, Total functional programming, J. UCS, vol.10, issue.7, pp.751-768, 2004.

P. Wadler, Comprehending monads, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.61-78, 1990.
DOI : 10.1145/91556.91592

P. Wadler, The marriage of effects and monads, International Conference on Functional Programming, pp.63-74, 1998.