M. Abadi and A. D. Gordon, A bisimulation method for cryptographic protocols, LNCS, vol.1381, issue.98, pp.12-26, 1998.
DOI : 10.1007/BFb0053560

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

S. Arun-kumar and M. Hennessy, An efficiency preorder for processes, Acta Informatica, vol.25, issue.1, pp.737-760, 1992.
DOI : 10.1007/BF01191894

K. Chaudhuri, M. Cimini, and D. Miller, Formalization of the bisimulation-up-to technique and its meta theory, 2014.

D. Hirschkoff, A full formalisation of pi-calculus theory in the calculus of constructions, TPHOLs, pp.153-169, 1997.

C. Hur, G. Neis, D. Dreyer, and V. Vafeiadis, The power of parameterization in coinductive proof, POPL, pp.193-206, 2013.

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. Hennessy, First-order reasoning for higher-order concurrency, Computer Languages, Systems & Structures, vol.38, issue.3, pp.242-277, 2012.
DOI : 10.1016/j.cl.2012.04.003

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

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

S. B. Lassen, Relational Reasoning about Contexts, Higher-order operational techniques in semantics, pp.91-135, 1998.
DOI : 10.7146/brics.v4i24.18950

S. B. Lassen, Relational Reasoning about Functions and Nondeterminism, 1998.

S. B. Lassen, Bisimulation in Untyped Lambda Calculus:, Electronic Notes in Theoretical Computer Science, vol.20, pp.346-374, 1999.
DOI : 10.1016/S1571-0661(04)80083-5

M. Lenisa, Themes in Final Semantics, 1998.

M. Merro and F. Z. Nardelli, Behavioral theory for mobile ambients, Journal of the ACM, vol.52, issue.6, pp.961-1023, 2005.
DOI : 10.1145/1101821.1101825

R. Milner, Communication and Concurrency, 1989.

J. , ?. A. Pohjola, and J. Parrow, Bisimulation up-to techniques for psi-calculi. Draft, 2014.

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. Rot, M. Bonsangue, and J. Rutten, Coalgebraic Bisimulation-Up-To, SOF- SEM'13, pp.369-381, 2013.
DOI : 10.1007/978-3-642-35843-2_32

D. Sangiorgi, On the bisimulation proof method, J. of MSCS, vol.8, pp.447-479, 1998.

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

D. Sangiorgi and D. Walker, The Pi-Calculus: a theory of mobile processes, 2001.

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

E. Sumii and B. C. Pierce, A bisimulation for type abstraction and recursion, J. ACM, vol.54, issue.5, 2007.

N. D. Turner, The polymorphic pi-calculus: Theory and Implementation, 1996.