S. Abramsky and C. L. Ong, Full Abstraction in the Lazy Lambda Calculus, Information and Computation, vol.105, issue.2, pp.159-267, 1993.
DOI : 10.1006/inco.1993.1044

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, O. Danvy, and K. Millikin, A dynamic continuation-passing style for dynamic delimited continuations, 2005.

D. Biernacki and S. Lenglet, Applicative Bisimulations for Delimited-Control Operators, FOSSACS'12, number 7213 in Lecture Notes in Computer Science, 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, 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, 1990.
DOI : 10.1145/91556.91622

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 and M. Hasegawa, A sound and complete axiomatization of delimited continuations, ICFP'03, SIGPLAN Notices, pp.177-188, 2003.

S. B. Lassen, Relational Reasoning about Contexts, Higher Order Operational Techniques in Semantics, pp.91-135, 1998.
DOI : 10.7146/brics.v4i24.18950
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5332

S. B. Lassen, Bisimulation in Untyped Lambda Calculus:, MFPS'99, pp.346-374, 1999.
DOI : 10.1016/S1571-0661(04)80083-5

S. B. Lassen, Eager Normal Form Bisimulation, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.345-354, 2005.
DOI : 10.1109/LICS.2005.15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.2914

S. B. Lassen, Normal Form Simulation for McCarthy's Amb, MFPS'05, pp.445-465, 2005.
DOI : 10.1016/j.entcs.2005.11.068

S. B. Lassen, Head normal form bisimulation for pairs and the ?µ-calculus, LICS'06, pp.297-306, 2006.

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.

D. Sangiorgi, The lazy lambda calculus in a concurrency scenario, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.102-109, 1992.
DOI : 10.1109/LICS.1992.185524

D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higherorder languages, LICS'07, pp.293-302, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01337665

D. Sangiorgi and D. Walker, The Pi-Calculus: A Theory of Mobile Processes, 2001.

K. Støvring and S. B. Lassen, A complete, co-inductive syntactic theory of sequential control and state, POPL'07, SIGPLAN Notices, pp.161-172, 2007.