A. Aristizábal, D. Biernacki, S. Lenglet, and P. Polesiuk, Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation, Logical Methods in Computer Science, vol.13, issue.3, 2017.

H. Basold, D. Pous, and J. Rot, Monoidal company for accessible functors, 7th Conference on Algebra and Coalgebra in Computer Science, vol.72, pp.1-5, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01529340

D. Biernacki, S. Lenglet, and P. Polesiuk, Proving soundness of extensional normal-form bisimilarities, Proceedings of the 33th Annual Conference on Mathematical Foundations of Programming Semantics, vol.336, pp.41-56, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01650000

F. Bonchi, D. Petrisan, D. Pous, and J. Rot, Coinduction up-to in a fibrational setting, Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, vol.20, pp.1-20, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00936488

N. A. Danielsson, Up-to techniques using sized types, vol.PACMPL, 2018.

C. Hur, G. Neis, D. Dreyer, and V. Vafeiadis, The power of parameterization in coinductive proof, The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '13, pp.193-206, 2013.

S. B. Lassen, Eager normal form bisimulation, LICS'05, pp.345-354, 2005.

R. Milner, Communication and Concurrency, 1989.

J. Parrow and T. Weber, The largest respectful function, Logical Methods in Computer Science, vol.12, issue.2, 2016.

D. Pous, Complete lattices and up-to techniques, APLAS'07, number 4807 in LNCS, pp.351-366, 2007.
URL : https://hal.archives-ouvertes.fr/ensl-00155308

D. Pous, Coinduction all the way up, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.307-316, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01259622

D. Pous and J. Rot, Companions, codensity and causality, Foundations of Software Science and Computation Structures -20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, vol.10203, pp.106-123, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01442222

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

J. J. Rutten, A coinductive calculus of streams, Mathematical Structures in Computer Science, vol.15, issue.1, pp.93-147, 2005.

D. Sangiorgi, On the bisimulation proof method, Mathematical Structures in Computer Science, vol.8, issue.5, pp.447-479, 1998.

S. Schäfer and G. Smolka, Tower induction and up-to techniques for CCS with fixed points, Relational and Algebraic Methods in Computer Science -16th International Conference, vol.10226, pp.274-289, 2017.