Z. M. Ariola, H. Herbelin, and A. Sabry, A proof-theoretic foundation of abortive continuations. Higher-Order and Symbolic Computation, pp.403-429, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00697242

K. Asai and Y. Kameyama, Polymorphic Delimited Continuations, Proceedings of the Fifth Asian symposium on Programming Languages and Systems, APLAS'07, number 4807 in Lecture Notes in Computer Science, pp.239-254, 2007.
DOI : 10.1007/978-3-540-76637-7_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.9907

M. Biernacka and D. Biernacki, A Context-based Approach to Proving Termination of Evaluation, Proceedings of the 25th Annual Conference on Mathematical Foundations of Programming Semantics, 2009.
DOI : 10.1016/j.entcs.2009.07.090

M. Biernacka and D. Biernacki, Context-based proofs of termination for typed delimited-control operators, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09
DOI : 10.1145/1599410.1599446

M. Biernacka, D. Biernacki, and O. Danvy, An operational foundation for delimited continuations in the CPS hierarchy, A preliminary version was presented at the Fourth ACM SIGPLAN Workshop on Continuations, pp.1-39, 2005.

M. Biernacka and O. Danvy, A syntactic correspondence between context-sensitive calculi and abstract machines, Theoretical Computer Science, vol.375, issue.1-3, pp.76-108, 2007.
DOI : 10.1016/j.tcs.2006.12.028
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.1749

O. Danvy and A. Filinski, A functional abstraction of typed contexts, DIKU Rapport, vol.8912, 1989.

O. Danvy and A. Filinski, Abstracting control, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.151-160, 1990.
DOI : 10.1145/91556.91622

O. Danvy and Z. Yang, An operational investigation of the CPS hierarchy, Proceedings of the Eighth European Symposium on Programming, number 1576 in Lecture Notes in Computer Science, pp.224-242, 1999.

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

A. Filinski, Representing layered monads, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, pp.175-188, 1999.
DOI : 10.1145/292540.292557
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2016

R. Harper, B. F. Duba, and D. Macqueen, Abstract, A preliminary version was presented at the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pp.465-484, 1991.
DOI : 10.1145/363744.363749

H. Herbelin and S. Ghilezan, An approach to call-by-name delimited continuations, Proceedings of the Thirty-Fifth Annual ACM Symposium on Principles of Programming Languages, pp.383-394, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00524949

Y. Kameyama, Axioms for Delimited Continuations in the CPS Hierarchy, Computer Science Logic, 18th International Workshop 13th Annual Conference of the EACSL, Proceedings, pp.442-457, 2004.
DOI : 10.1007/978-3-540-30124-0_34

Y. Kameyama, O. Kiselyov, and C. Shan, Shifting the stage, Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation, PEPM '09, pp.111-120, 2009.
DOI : 10.1145/1480945.1480962

O. Kiselyov, Call-by-name linguistic side effects, Proceedings of the 2008 Workshop on Symmetric Calculi and Ludics for the Semantic Interpretation, 2008.

O. Kiselyov, Delimited Control in OCaml, Abstractly and Concretely: System Description, Functional and Logic Programming, 10th International Symposium, FLOPS 2010, number 6009 in Lecture Notes in Computer Science, pp.304-320, 2010.
DOI : 10.1007/978-3-642-12251-4_22

O. Kiselyov and C. , Embedded Probabilistic Programming, number 5658 in Lecture Notes in Computer Science, pp.360-384, 2009.
DOI : 10.1017/S0956796899003469
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1762

O. Kiselyov, C. Shan, D. C. Richardson, T. R. Roth-berghofer, and L. Vieu, Delimited Continuations in Operating Systems, Modeling and Using Context, 6th International and Interdisciplinary Conference, CONTEXT 2007, number 4635 in Lecture Notes in Artificial Intelligence, pp.291-302, 2007.
DOI : 10.1007/978-3-540-74255-5_22

O. Kiselyov and C. Shan, A Substructural Type System for Delimited Continuations, Typed Lambda Calculi and Applications, 8th International Conference, TLCA 2007, number 4583 in Lecture Notes in Computer Science, pp.223-239, 2007.
DOI : 10.1007/978-3-540-73228-0_17

M. Masuko and K. Asai, Direct implementation of shift and reset in the MinCaml compiler, Proceedings of the 2009 ACM SIGPLAN workshop on ML, ML '09, pp.49-60, 2009.
DOI : 10.1145/1596627.1596636

C. R. Murthy, Control operators, hierarchies, and pseudo-classical type systems: A-translation at work

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. Saurin, A Hierarchy for Delimited Continuations in Call-by-Name, Foundations of Software Science and Computation Structures, 13th International Conference, FOSSACS 2010, number 6014 in Lecture Notes in Computer Science, pp.374-388, 2010.
DOI : 10.1007/978-3-642-12032-9_26
URL : https://hal.archives-ouvertes.fr/hal-00527925

W. W. Tait, Intensional interpretations of functionals of finite type I, The Journal of Symbolic Logic, vol.91, issue.02, pp.198-212, 1967.
DOI : 10.1007/BF01447860

N. Zeilberger, Polarity and the Logic of Delimited Continuations, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.219-227, 2010.
DOI : 10.1109/LICS.2010.23
URL : https://hal.archives-ouvertes.fr/hal-00548167