Z. Ariola and &. Felleisen, The call-by-need lambda calculus, Journal of Functional Programming, vol.7, issue.3, pp.265-301, 1993.
DOI : 10.1017/S0956796897002724

Z. M. Ariola and P. Downen, Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts, Functional and Logic Programming -11th International Symposium, FLOPS 2012 Proceedings, Lecture Notes in Computer Science, pp.32-46, 2012.
DOI : 10.1007/978-3-642-29822-6_6

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

Z. M. Ariola, H. Herbelin, and &. Sabry, A Type-Theoretic Foundation of Continuations and Prompts, Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, pp.40-53, 2004.

Z. M. Ariola, H. Herbelin, and &. Saurin, Classical Call-by-Need and Duality, Typed Lambda Calculi and Applications -10th International Conference, pp.27-44, 2011.
DOI : 10.1017/S096012950000311X

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

T. Crolard, A confluent ??-calculus with a catch/throw mechanism, Journal of Functional Programming, vol.9, issue.6, pp.625-64710, 1999.
DOI : 10.1017/S0956796899003512

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

&. Pierre-louis-curien and . Hugo-herbelin, The duality of computation, Proceedings of ICFP 2000, pp.233-243, 2000.
DOI : 10.1145/357766.351262

M. Felleisen, D. P. Friedman, E. E. Kohlbecker, &. Bruce, and F. Duba, Reasoning with Continuations, Proceedings of the Symposium on Logic in Computer Science (LICS '86), pp.131-141, 1986.

H. Herbelin, C'est maintenant qu'on calcule: au coeur de la dualité, 2005.

J. Krivine, Realizability in classical logic, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00154500

J. Maraist, M. Odersky, and &. Philip-wadler, The call-by-need lambda calculus, Journal of Functional Programming, vol.8, issue.3, pp.275-317, 1998.
DOI : 10.1017/S0956796898003037

E. Moggi, Computational lambda-calculus and monads, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 1988.
DOI : 10.1109/LICS.1989.39155

C. Okasaki, P. Lee, and &. David-tarditi, Call-by-need and continuation-passing style, LISP and Symbolic Computation, vol.35, issue.1, pp.57-82, 1994.
DOI : 10.1007/BF01019945

M. Parigot, Free deduction: An analysis of ???Computations??? in classical logic, Proceedings of LPAR, pp.361-380, 1991.
DOI : 10.1007/3-540-55460-2_27

G. D. Plotkin, Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-15910, 1975.
DOI : 10.1016/0304-3975(75)90017-1

A. Sabry and &. Felleisen, Reasoning about Programs in Continuation-Passing Style, Lisp and Symbolic Computation, vol.634, pp.289-360, 1993.