T. 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-57, 1990.
DOI : 10.1145/96709.96714

M. Parigot, ?µ-calculus: An algorithmic interpretation of classical natural deduction, LPAR: Logic Programming and Automated Reasoning, International Conference, ser. LNCS, pp.190-201, 1992.

T. Crolard, A confluent ??-calculus with a catch/throw mechanism, Journal of Functional Programming, vol.9, issue.6, pp.625-647, 1999.
DOI : 10.1017/S0956796899003512
URL : https://hal.archives-ouvertes.fr/hal-00094601

J. Girard, A new constructive logic: classic logic, Mathematical Structures in Computer Science, vol.7, issue.2, pp.255-296, 1991.
DOI : 10.1016/0304-3975(87)90045-4

J. Andreoli, Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation, vol.2, issue.3, pp.297-347, 1992.
DOI : 10.1093/logcom/2.3.297

C. Liang and D. Miller, Kripke semantics and proof systems for combining intuitionistic logic and classical logic, Annals of Pure and Applied Logic, vol.164, issue.2, pp.86-111, 2013.
DOI : 10.1016/j.apal.2012.09.005
URL : https://hal.archives-ouvertes.fr/hal-00787601

P. De-groote, An environment machine for the ????-calculus, Mathematical Structures in Computer Science, vol.8, issue.6, pp.637-669, 1998.
DOI : 10.1017/S0960129598002667
URL : https://hal.archives-ouvertes.fr/inria-00098499

T. Streicher and B. Reus, Classical logic, continuation semantics and abstract machines, Journal of Functional Programming, vol.8, issue.6, pp.543-572, 1998.
DOI : 10.1017/S0956796898003141

E. Ritter, D. Pym, and L. Wallen, Proof-terms for classical and intuitionistic resolution, Journal of Logic and Computation, vol.10, issue.2, pp.173-207, 2000.
DOI : 10.1093/logcom/10.2.173
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.99

H. Nakano, A constructive formalization of the catch and throw mechanism, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.82-89, 1992.
DOI : 10.1109/LICS.1992.185522

H. Herbelin, An Intuitionistic Logic that Proves Markov's Principle, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.50-56, 2010.
DOI : 10.1109/LICS.2010.49
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.4521

M. C. Fitting, Intuitionistic Logic Model Theory and Forcing, 1969.

C. Liang and D. Miller, Focusing and polarization in linear, intuitionistic, and classical logics, Theoretical Computer Science, vol.410, issue.46, pp.4747-4768, 2009.
DOI : 10.1016/j.tcs.2009.07.041

M. Felleisen, D. Friedman, E. Kohlbecker, and B. Duba, A syntactic theory of sequential control, Theoretical Computer Science, vol.52, issue.3, pp.205-237, 1987.
DOI : 10.1016/0304-3975(87)90109-5