F. Bonchi and D. Pous, Checking nfa equivalence with bisimulations up to congruence, Proc. POPL'13. pp. 457{468, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00639716

R. Demangeon, D. Hirschko, and D. Sangiorgi, Termination in impure concurrent languages, Proc. 21th CONCUR, vol.6269, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00798789

A. Durier, D. Hirschko, and D. Sangiorgi, Divergence and unique solution of equations, 1{11:16. Schloss Dagstuhl-LeibnizZentrum fuer Informatik, vol.85, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01643502

A. Durier, D. Hirschko, and D. Sangiorgi, Eager functions as processes, 33nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01917255

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

S. Lassen, Relational reasoning about contexts, Higher-order operational techniques in semantics. pp. 91{135, 1998.

S. Lassen, Bisimulation in untyped lambda calculus: B ohm trees and bisimulation up to context, Electr. Notes Theor. Comput. Sci, vol.20, pp.346-374, 1999.

R. Milner, Communication and Concurrency, 1989.

R. Milner, Functions as processes, Journal of Mathematical Structures in Computer Science, vol.2, issue.2, pp.119-141, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00075405

R. Milner, Functions as processes, ICALP. LNCS 443, pp. 167{180, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075405

A. Pi-erard and E. Sumii, Sound bisimulations for higher-order distributed process calculus, Proc. FOSSACS, vol.6604, 2011.

A. Pitts, Howe's method, Advanced Topics in Bisimulation and Coinduction, 2012.

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

A. W. Roscoe, An alternative order for the failures model, J. Log. Comput, vol.2, issue.5, pp.557-577, 1992.

A. W. Roscoe, The theory and practice of concurrency, 1998.

J. Rot, M. M. Bonsangue, and J. J. Rutten, Coinductive proof techniques for language equivalence, Proc. LATA, vol.7810, pp.480-492, 2013.

D. Sangiorgi and R. Milner, The problem of \Weak Bisimulation up to, Proc. CONCUR '92, vol.630, pp.32-46, 1992.

D. Sangiorgi and D. Walker, The-calculus: a Theory of Mobile Processes, 2001.

D. Sangiorgi, Termination of processes, Mathematical Structures in Computer Science, vol.16, issue.1, pp.1-39, 2006.

D. Sangiorgi, Equations, contractions, and unique solutions, POPL 2015. pp. 421{432. ACM, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01089205

D. Sangiorgi, Equations, contractions, and unique solutions, ACM Trans. Comput. Log, vol.18, issue.1, 2017.
DOI : 10.1145/2775051.2676965
URL : https://hal.archives-ouvertes.fr/hal-01089205

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.
DOI : 10.1109/lics.2007.17
URL : https://hal.archives-ouvertes.fr/hal-01337665

N. Yoshida, M. Berger, and K. Honda, Strong Normalisation in the Pi-Calculus. Information and Computation, vol.191, pp.145-202, 2004.
DOI : 10.1109/lics.2001.932507
URL : http://www.doc.ic.ac.uk/~yoshida/paper/tr-2001-09.ps.gz