P. Baillot and V. Mogbil, Soft lambda-Calculus: A Language for Polynomial Time Computation, Proc. FoSSaCS, Springer LNCS 2987, pp.27-41, 2004.
DOI : 10.1007/978-3-540-24727-2_4

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

R. Davies, A temporal-logic approach to binding-time analysis, Logic in Computer Science, pp.184-195, 1996.

R. Davies and F. Pfenning, A Modal Analysis of Staged Computation. Principles of programming languages, 1996.

M. Gaboardi, S. Ronchi, and D. Rocca, A Soft Type Assignment System for ??-Calculus, 2007.
DOI : 10.1007/978-3-540-74915-8_21

T. G. Griffin, A formulae-as-type notion of control, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.47-58, 1990.
DOI : 10.1145/96709.96714

J. and R. Hindley, The Church-Rosser Property and a Result in Combinatory Logic, 1964.

N. D. Jones, Computability and Complexity, 1997.

S. C. Kleene, On notation for ordinal numbers, The Journal of Symbolic Logic, vol.28, issue.04, pp.150-155, 1938.
DOI : 10.1215/S0012-7094-36-00227-2

J. Krivine, Dependent choice, ???quote??? and the clock, Theoretical Computer Science, vol.308, issue.1-3, 2003.
DOI : 10.1016/S0304-3975(02)00776-4

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

J. Krivine, A call-by-name lambda-calculus machine, Higher-Order and Symbolic Computation, vol.6, issue.3, pp.199-207, 2007.
DOI : 10.1007/s10990-007-9018-9

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

Y. Lafont, Soft linear logic and polynomial time, Theoretical Computer Science, vol.318, issue.1-2, 2002.
DOI : 10.1016/j.tcs.2003.10.018

J. Marion, From Turing machines to computer viruses, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.6, issue.8, pp.3319-3339, 1971.
DOI : 10.1098/rstb.1952.0012

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

S. Martini and A. Masini, Abstract, The Journal of Symbolic Logic, vol.1, issue.03, pp.888-899, 1994.
DOI : 10.2307/2275915

A. Mendhekar and D. Friedman, Towards a theory of reflexive programming languages, Worskshop on Reflection and Meta-level Architectures, 1993.

N. Yiannis and . Moschovakis, Kleene's amazing second recursion theorem, Bulletin of Symbolic Logic, vol.16, issue.2, pp.189-239, 2010.

A. Nanevski, F. Pfenning, and B. Pientka, Contextual modal type theory, ACM Transactions on Computational Logic, vol.9, issue.3, 2007.
DOI : 10.1145/1352582.1352591

K. Barry and . Rosen, Tree-Manipulating Systems and Church-Rosser Theorems, J. ACM, vol.20, issue.1, pp.160-187, 1973.

H. Schellinx, A Linear Approach to Modal Proof Theory, pp.33-43, 1996.
DOI : 10.1007/978-94-017-2798-3_3

P. Selinger, From Continuation Passing Style to Krivine Abstract Machine, 2003.

W. Taha, A Gentle Introduction to Multi-stage Programming. Domain-Specific Program Generation, 2004.

P. Wadler, A syntax for linear logic, International Conference on the Mathematical Foundations of Programming Semantics, 1993.
DOI : 10.1007/3-540-58027-1_24