S. Abramsky, The lazy lambda calculus, Research Topics in Functional Programming, pp.65-116, 1990.

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, Sound and complete bisimilarities for call-by-name and call-by-value ?µcalculus, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00926100

R. David and W. Py, Abstract, The Journal of Symbolic Logic, vol.121, issue.01, pp.407-413, 2001.
DOI : 10.2307/2694930

P. De-groote, On the relation between the ?µ-calculus and the syntactic theory of sequential control, LPAR'94, number 822 in LNAI, pp.31-43, 1994.

M. Felleisen and R. Hieb, The revised report on the syntactic theories of sequential control and state, Theoretical Computer Science, vol.103, issue.2, pp.235-271, 1992.
DOI : 10.1016/0304-3975(92)90014-7

A. D. Gordon, Bisimilarity as a theory of functional programming, Theoretical Computer Science, vol.228, issue.1-2, pp.5-47, 1999.
DOI : 10.1016/S0304-3975(98)00353-3

D. J. Howe, Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, vol.124, issue.2, pp.103-112, 1996.
DOI : 10.1006/inco.1996.0008

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

S. B. Lassen, Bisimulation for pure untyped ?µ-caluclus (extended abstract) Unpublished note, 1999.

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

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

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

C. L. Ong and C. A. Stewart, A Curry-Howard foundation for functional computation with control, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.215-227, 1997.
DOI : 10.1145/263699.263722

M. Parigot, ?µ-calculus: an algorithmic interpretation of classical natural deduction, LPAR'92, number 624 in LNAI, pp.190-201, 1992.

A. Sabry and M. Felleisen, Reasoning about programs in continuation-passing style, Lisp and Symbolic Computation, pp.289-360, 1993.

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 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

K. Støvring and S. B. Lassen, A complete, co-inductive syntactic theory of sequential control and state