M. Abadi and A. D. Gordon, A bisimulation method for cryptographic protocols, Proc. ESOP'98, pp.12-26, 1998.
DOI : 10.1007/BFb0053560

S. Abramsky, The Lazy ?-Calculus, Research Topics in Functional Programming, pp.65-117, 1990.

D. Biernacki and S. Lenglet, Environmental Bisimulations for Delimited-Control Operators, APLAS, pp.333-348, 2013.
DOI : 10.1007/978-3-319-03542-0_24
URL : https://hal.archives-ouvertes.fr/hal-00903839

A. Bizjak and L. Birkedal, Step-Indexed Logical Relations for Probability, Proc. FoSSaCS'15, pp.279-294, 2015.
DOI : 10.1007/978-3-662-46678-0_18

M. Boreale and D. Sangiorgi, Bisimulation in name-passing calculi without matching, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), 1998.
DOI : 10.1109/LICS.1998.705653

R. Crubillé and U. Dal-lago, On Probabilistic Applicative Bisimulation and Call-by-Value ??-Calculi, Proc. ESOP'14, pp.209-228, 2014.
DOI : 10.1007/978-3-642-54833-8_12

R. Crubillé, U. Dal-lago, D. Sangiorgi, and V. Vignudelli, On Applicative Similarity, Sequentiality, and Full Abstraction, Correct System Design, pp.65-82, 2015.
DOI : 10.1007/978-3-319-23506-6_7

U. , D. Lago, and M. Zorzi, Probabilistic operational semantics for the lambda calculus. RAIRO -Theor, Inf. and Applic, vol.46, issue.3, pp.413-450, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00909373

U. Dal-lago, D. Sangiorgi, and M. Alberti, On coinductive equivalences for higher-order probabilistic functional programs, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.297-308, 2014.
DOI : 10.1145/2535838.2535872
URL : https://hal.archives-ouvertes.fr/hal-01091573

V. Danos and R. S. Harmer, Probabilistic game semantics, ACM Transactions on Computational Logic, vol.3, issue.3, pp.359-382, 2002.
DOI : 10.1145/507382.507385

T. Ehrhard, C. Tasson, and M. Pagani, Probabilistic coherence spaces are fully abstract for probabilistic PCF, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.309-320, 2014.
DOI : 10.1145/2535838.2535865

A. D. Gordon, Bisimilarity as a Theory of Functional Programming, Electronic Notes in Theoretical Computer Science, vol.1, pp.232-252, 1995.
DOI : 10.1016/S1571-0661(04)80013-6

J. Goubault-larrecq, Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases, Journal of Logical and Algebraic Methods in Programming, vol.84, issue.1, pp.155-184, 2015.
DOI : 10.1016/j.jlamp.2014.09.003

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

C. Hur, D. Dreyer, G. Neis, and V. Vafeiadis, The marriage of bisimulations and Kripke logical relations, Proc. POPL'12, pp.59-72, 2012.

R. Jagadeesan, C. Pitcher, and J. Riely, Open bisimulation for aspects. T. Aspect-Oriented Software Development, pp.72-132, 2009.

A. Jeffrey and J. Rathke, Towards a theory of bisimulation for local names, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.56-66, 1999.
DOI : 10.1109/LICS.1999.782586

V. Koutavas and M. Wand, Small bisimulations for reasoning about higher-order imperative programs, Proc. POPL'06, pp.141-152, 2006.

V. Koutavas and M. Wand, Bisimulations for Untyped Imperative Objects, Proc. ESOP'06, pp.146-161, 2006.
DOI : 10.1006/inco.1995.1018

V. Koutavas, P. B. Levy, and E. Sumii, From Applicative to Environmental Bisimulation, 21] S. B. Lassen. Relational Reasoning about Functions and Nondeterminism, pp.215-235, 1998.
DOI : 10.1016/j.entcs.2011.09.023

S. B. Lassen and P. B. Levy, Typed Normal Form Bisimulation, CSL 2007, pp.283-297, 2007.
DOI : 10.1007/978-3-540-74915-8_23

J. Maraist, M. Odersky, D. N. Turner, and P. Wadler, Call-by-name, call-by-value, call-by-need and the linear lambda calculus, Theoretical Computer Science, vol.228, issue.1-2, pp.175-210, 1999.
DOI : 10.1016/S0304-3975(98)00358-2

R. Milner, Pure bigraphs: Structure and dynamics, Information and Computation, vol.204, issue.1, pp.60-122, 2006.
DOI : 10.1016/j.ic.2005.07.003

J. C. Mitchell, Foundations for Programming Languages, 1996.

A. Piérard and E. Sumii, Sound Bisimulations for Higher-Order Distributed Process Calculus, Proc. FoSSaCS'11, pp.123-137, 2011.
DOI : 10.1007/978-3-642-19805-2_9

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

A. Pitts, Typed operational reasoning, Advanced Topics in Types and Programming Languages, pp.245-289, 2005.

A. M. Pitts, Howe's method for higher-order languages, Advanced Topics in Bisimulation and Coinduction, pp.197-232, 2011.
DOI : 10.1017/CBO9780511792588.006

D. Pous and D. Sangiorgi, Enhancements of the bisimulation proof method, Advanced Topics in Bisimulation and Coinduction, 2012.
DOI : 10.1017/CBO9780511792588.007
URL : https://hal.archives-ouvertes.fr/hal-00909391

J. Rutten and B. Jacobs, (co)algebras and (co)induction, Advanced Topics in Bisimulation and Coinduction, 2012.

D. Sands, From SOS rules to proof principles, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.428-441, 1997.
DOI : 10.1145/263699.263760

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

D. Sangiorgi, N. Kobayashi, and E. Sumii, Logical Bisimulations and Functional Languages, Proc. FSEN'07, pp.364-379, 2007.
DOI : 10.1007/978-3-540-75698-9_24

D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higher-order languages, ACM Trans. Program. Lang. Syst, vol.33, issue.1, p.5, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01337665

N. Sato and E. Sumii, The higher-order, call-by-value applied picalculus, Proc. APLAS'09, pp.311-326, 2009.

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

E. Sumii and B. C. Pierce, A bisimulation for dynamic sealing, Proc. POPL'04, pp.169-192, 2004.
DOI : 10.1016/j.tcs.2006.12.032

E. Sumii and B. C. Pierce, A bisimulation for type abstraction and recursion, 2007. A preliminary version in Proc. POPL'05, 2005.