P. Aczel and N. Mendler, A final coalgebra theorem, Proceedings category theory and computer science, pp.357-365, 1989.
DOI : 10.1007/BFb0018361

J. Adámek, H. Herrlich, and G. E. Strecker, Abstract and Concrete Categories, 1990.

M. Barr, Terminal coalgebras in well-founded set theory, Theoretical Computer Science, vol.114, issue.2, pp.299-315, 1993.
DOI : 10.1016/0304-3975(93)90076-6
URL : http://doi.org/10.1016/0304-3975(93)90076-6

H. P. Gumm, Elements of the general theory of coalgebras, LUATCS, vol.99, 1999.

H. P. Gumm, Functors for coalgebras, Algebra Universalis, vol.45, pp.135-147, 2001.

H. P. Gumm and T. Schröder, Coalgebraic Structure from Weak Limit Preserving Functors, Electronic Notes in Theoretical Computer Science, issue.33, pp.113-133, 2000.

H. P. Gumm and T. Schröder, Products of coalgebras, Algebra Universalis, vol.46, issue.1, pp.163-185, 2001.
DOI : 10.1007/PL00000334

H. P. Gumm and T. Schröder, Types and coalgebraic structure, Algebra universalis, vol.53, issue.2-3, pp.229-252, 2005.
DOI : 10.1007/s00012-005-1888-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.6492

H. P. Gumm and M. Zarrad, Coalgebraic Simulations and Congruences, Coalgebraic Methods in Computer Science, vol.16, pp.118-134, 2014.
DOI : 10.1007/978-3-662-44124-4_7
URL : https://hal.archives-ouvertes.fr/hal-01408755

C. Kupke, H. Hansen, and E. Pacuit, Bisimulations for neighbourhood structures. algebra and coalgebra in computer science, Lecture Notes in Computer Science, pp.279-293, 2007.

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985.
DOI : 10.1145/2455.2460
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.1770

C. Hermida and B. Jacobs, Structural Induction and Coinduction in a Fibrational Setting, Information and Computation, vol.145, issue.2, pp.107-152, 1998.
DOI : 10.1006/inco.1998.2725
URL : http://doi.org/10.1006/inco.1998.2725

J. Marti and Y. Venema, Lax Extensions of Coalgebra Functors, Coalgebraic Methods in Computer ScienceLNCS, vol.73, pp.150-169, 2012.
DOI : 10.1007/978-3-642-32784-1_9

L. S. Moss, Coalgebraic logic, Annals of Pure and Applied Logic, vol.96, issue.1-3, pp.277-317, 1999.
DOI : 10.1016/S0168-0072(98)00042-6
URL : http://doi.org/10.1016/s0168-0072(98)00042-6

D. Pattinson, Expressive Logics for Coalgebras via Terminal Sequence Induction, Notre Dame Journal of Formal Logic, vol.45, issue.1, pp.19-33, 2004.
DOI : 10.1305/ndjfl/1094155277

J. Riguet, Relations binaires, fermetures, correspondances de Galois, Bulletin de la Société mathématique de France, vol.2, pp.114-155, 1948.
DOI : 10.24033/bsmf.1401
URL : http://archive.numdam.org/article/BSMF_1948__76__114_0.pdf

J. J. Rutten, Universal coalgebra: a theory of systems, Theoretical Computer Science, vol.249, issue.1, pp.3-80, 2000.
DOI : 10.1016/S0304-3975(00)00056-6

T. Schröder, Coalgebren und Funktoren. Doktorarbeit, 2001.

S. Staton, Relating coalgebraic notions of bisimulaions, Logical Methods in Computer Science, vol.7, issue.1, 2011.
DOI : 10.2168/lmcs-7(1:13)2011
URL : http://arxiv.org/abs/1101.4223

A. Thijs, Simulation and Fixpoint Semantics, 1996.

V. Trnková, Some properties of set functors, Comm. Math. Univ. Carolinae, vol.10, issue.2, pp.323-352, 1969.