K. Asai and Y. Kameyama, Polymorphic Delimited Continuations, APLAS'07, number 4807 in LNCS, 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

V. Balat, R. D. Cosmo, and M. P. Fiore, Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums, ACM SIGPLAN Notices, vol.39, issue.1, pp.64-76, 2004.
DOI : 10.1145/982962.964007
URL : https://hal.archives-ouvertes.fr/hal-00149561

M. Biernacka, D. Biernacki, and O. Danvy, An operational foundation for delimited continuations in the CPS hierarchy, Logical Methods in Computer Science, vol.1, issue.25, pp.1-39, 2005.

D. Biernacki and S. Lenglet, Applicative Bisimulations for Delimited-Control Operators, FOSSACS'12, number 7213 in LNCS, pp.119-134, 2012.
DOI : 10.1007/978-3-642-28729-9_8
URL : https://hal.archives-ouvertes.fr/hal-01399945

D. Biernacki and S. Lenglet, Normal Form Bisimulations for Delimited-Control Operators, FLOPS'12, number 7294 in LNCS, pp.47-61, 2012.
DOI : 10.1007/978-3-642-29822-6_7
URL : https://hal.archives-ouvertes.fr/hal-01399951

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
DOI : 10.1145/91556.91622

R. K. Dybvig, S. Peyton-jones, and A. Sabry, A monadic framework for delimited continuations, Journal of Functional Programming, vol.17, issue.6, pp.687-730, 2007.

M. Felleisen, The theory and practice of first-class prompts, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.180-190, 1988.
DOI : 10.1145/73560.73576

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

Y. Kameyama, Axioms for control operators in the CPS hierarchy. Higher-Order and Symbolic Computation, pp.339-369, 2007.

Y. Kameyama and M. Hasegawa, A sound and complete axiomatization of delimited continuations, ICFP'03, SIGPLAN Notices, pp.177-188, 2003.

V. Koutavas, P. B. Levy, and E. Sumii, From Applicative to Environmental Bisimulation, Electronic Notes in Theoretical Computer Science, vol.276, pp.215-235, 2011.
DOI : 10.1016/j.entcs.2011.09.023

R. Milner, Fully abstract models of typed ??-calculi, Theoretical Computer Science, vol.4, issue.1, pp.1-22, 1977.
DOI : 10.1016/0304-3975(77)90053-6

J. H. Morris, Lambda Calculus Models of Programming Languages, 1968.

A. Piérard and E. Sumii, A Higher-Order Distributed Calculus with Name Creation, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.531-540, 2012.
DOI : 10.1109/LICS.2012.63

D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higher-order languages, ACM Transactions on Programming Languages and Systems, vol.33, issue.1, pp.1-69, 2011.
DOI : 10.1145/1889997.1890002
URL : https://hal.archives-ouvertes.fr/hal-01337665

N. Sato and E. Sumii, The Higher-Order, Call-by-Value Applied Pi-Calculus, APLAS'09, pp.311-326, 2009.
DOI : 10.1007/978-3-642-10672-9_22

D. Sitaram and M. Felleisen, Reasoning with continuations II: full abstraction for models of control, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.161-175
DOI : 10.1145/91556.91626

E. Sumii, A bisimulation-like proof method for contextual properties in untyped lambda-calculus with references and deallocation, Theoretical Computer Science, vol.411, pp.51-524358, 2010.

E. Sumii and B. C. Pierce, A bisimulation for dynamic sealing, Theoretical Computer Science, vol.375, issue.1-3, pp.169-192, 2007.
DOI : 10.1016/j.tcs.2006.12.032