F. Barbanera and S. Berardi, A Symmetric Lambda Calculus for Classical Program Extraction, Information and Computation, vol.125, issue.2, pp.103-117, 1996.
DOI : 10.1006/inco.1996.0025

T. Crolard, Typage des coroutines en logique soustractive, Proc. Journées Francophones des Langages Applicatifs, 1999.

P. Curien and H. Herbelin, Computing with Abstract Böhm Trees, Proceedings of the 3rd Fuji International Symposium on Functional and Logic Programming, pp.20-39, 1998.

V. Danos, Sequent Calculus and Continuation Passing Style Compilation, Proc. of the 11th Congress of Logic, 1999.

V. Danos, J. Joinet, and H. Schellinx, LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of classical implication, Advances in Linear Logic, pp.211-224, 1995.

V. Danos, J. Joinet, and H. Schellinx, Abstract, The Journal of Symbolic Logic, vol.II, issue.03, pp.755-807, 1997.
DOI : 10.1007/BF00885763
URL : https://hal.archives-ouvertes.fr/inria-00528352

V. Danos and L. Regnier, Machina ex deo, ou encore quelque chosè a dire sur la machine de Krivine, 1990.

A. Filinski, Declarative continuations: An investigation of duality in programming language semantics, Proc. of Category Theory and Computer Science (CTCS), pp.224-249, 1989.
DOI : 10.1007/BFb0018355

G. Gentzen, Investigations into logical deduction. E.g. in Gentzen collected works, p.68, 1935.

J. Girard, On the unity of logic, Annals of Pure and Applied Logic, vol.59, issue.3, pp.201-217, 1993.
DOI : 10.1016/0168-0072(93)90093-S
URL : https://hal.archives-ouvertes.fr/inria-00075095

. Ph and . De-groote, On the relation between the ?µ-calculus and the syntactic theory of control, Proc. of the International Conference on Logic Programming and Automated Reasoning (LPAR), pp.31-43, 1994.

H. Herbelin, A ??-calculus structure isomorphic to Gentzen-style sequent calculus structure, Proc. of Computer Science Logic (CSL), pp.61-75, 1994.
DOI : 10.1007/BFb0022247
URL : https://hal.archives-ouvertes.fr/inria-00381525

K. Honda and N. Yoshida, Game-theoretic analysis of call-by-value computation, Proc. of International Colloquium on Automata Languages and Programs (ICALP), Lecture Notes in Computer Science 1256, 1997.

M. Hofmann and T. Streicher, Continuation models are universal for ?µ-calculus, Proc. of Logic in Computer Science (LICS), pp.387-397, 1997.

O. Laurent, C. H. Ong, and C. A. Stewart, Polarized proof-nets and ?µ-calculus A Curry-Howard Foundation for functional computation with control, Proc. of ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages (POPL), 1997.

I. Ogata, Constructive Classical Logic as CPS-calculus. To appear in, International Journal of Foundations of Functional Programming, 1999.

M. Parigot, ?µ-calculus: An algorithmic interpretation of classical natural deduction, Proc. of the International Conference on Logic Programming and Automated Reasoning (LPAR), 1992.

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

]. A. Sabry and M. Felleisen, Reasoning about programs in continuation-passing style, Lisp and Symbolic Computation, vol.6, issue.34, pp.156377-287, 1993.

A. Sabry and P. Wadler, A reflection on call-by-value, ACM Transactions on Programming Languages and Systems, vol.19, issue.6, pp.916-941, 1997.
DOI : 10.1145/267959.269968

P. Selinger, Control categories and duality: on the categorical semantics of the lambda-mu calculus, Mathematical Structures in Computer Science, vol.11, issue.2, 1999.
DOI : 10.1017/S096012950000311X

C. Urban and G. Bierman, Strong normalization of cut-elimination in classical logic, Proc. of Typed Lambda Calculus and Applications (TLCA), Lecture Notes in Computer Science 1581, 1999.