F. Bartels, Generalised coinduction. Mathematical Structures in Computer Science, vol.13, issue.2, pp.321-348, 2003.

F. Bonchi, A. Silva, and A. Sokolova, The power of convex algebras, 28th International Conference on Concurrency Theory, vol.85, pp.1-23, 2017.

M. Bonsangue and A. Kurz, Duality for logics of transition systems, Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005, pp.455-469, 2005.

M. Bonsangue, S. Milius, and A. Silva, Sound and complete axiomatizations of coalgebraic language equivalence, ACM Trans. Comput. Log, vol.14, issue.1, 2013.

V. Capretta, T. Uustalu, and V. Vene, Recursive coalgebras from comonads, Inf. Comput, vol.204, issue.4, pp.437-468, 2006.

V. Capretta, T. Uustalu, and V. Vene, Corecursive algebras: A study of general structured corecursion, Formal Methods: Foundations and Applications, number 5902 in Lect. Notes Comp. Sci, pp.84-100, 2009.

L. Chen and A. Jung, On a categorical framework for coalgebraic modal logic, Electr. Notes Theor. Comput. Sci, vol.308, pp.109-128, 2014.

C. C??rsteac??rstea, A coalgebraic approach to quantitative linear time logics, 2016.

A. , Coalgebra-to-algebra morphisms, Electr. Notes Theor. Comput. Sci, vol.29, pp.42-49, 1999.

J. Y. Girard, Y. Lafont, and P. Taylor, Proofs and Types, Cambridge Tracts in Theoretical Computer Science, vol.7, 1988.

I. Hasuo, Generic weakest precondition semantics from monads enriched with order, Theor. Comput. Sci, vol.604, pp.2-29, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01408750

I. Hasuo, B. Jacobs, and A. Sokolova, Generic trace semantics via coinduction, Log. Meth. Comp. Sci, vol.3, issue.4, 2007.

W. Hino, H. Kobayashi, I. Hasuo, and B. Jacobs, Healthiness from duality, Logic in Computer Science. IEEE, 2016.

R. Hinze, N. Wu, and J. Gibbons, Conjugate hylomorphisms-or: The mother of all structured recursion schemes, Proceedings of the Symposium on Principles of Programming Languages, pp.527-538, 2015.

B. Jacobs, A bialgebraic review of deterministic automata, regular expressions and languages, Algebra, Meaning, and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, pp.375-404, 2006.

B. Jacobs, A recipe for state and effect triangles, Log. Meth. Comp. Sci, vol.13, issue.2, 2017.

B. Jacobs, A. Silva, and A. Sokolova, Trace semantics via determinization, Journ. of Computer and System Sci, vol.81, issue.5, pp.859-879, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01539887

G. M. Kelly and R. Street, Review of the elements of 2-categories, Category Seminar: Proceedings Sydney Category Seminar 1972/1973, number 420 in Lecture Notes in Mathematics, 1974.

H. Kerstan, B. König, and B. Westerbaan, Lifting adjunctions to coalgebras to (re)discover automata constructions, Coalgebraic Methods in Computer Science (CMCS 2014), vol.8446, pp.168-188, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01408759

B. Klin, Coalgebraic modal logic beyond sets, Math. Found. of Programming Semantics, number 173 in Elect. Notes in Theor. Comp. Sci, 2007.

B. Klin and J. Rot, Coalgebraic trace semantics via forgetful logics, Log. Meth. Comp. Sci, vol.12, issue.10, 2016.

A. Kurz, S. Milius, D. Pattinson, and L. Schröder, Simplified coalgebraic trace equivalence, Software, Services, and Systems-Essays Dedicated to Martin Wirsing on the Occasion of His Retirement from the Chair of Programming and Software Engineering, pp.75-90, 2015.

T. Leinster, Higher Operads, Higher Categories, London Mathematical Society Lecture Notes, vol.298, 2004.

P. Levy, Final coalgebras from corecursive algebras, Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), vol.35, pp.221-237, 2015.

S. Milius, D. Pattinson, and L. Schröder, Generic trace semantics and graded monads, 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, pp.253-269, 2015.

S. Milius, Completely iterative algebras and completely iterative monads, Inf. Comput, vol.196, issue.1, pp.1-41, 2005.

D. Pavlovi´cpavlovi´c, M. Mislove, and J. Worrell, Testing semantics: Connecting processes and process logics, Algebraic Methods and Software Technology, number 4019 in Lect. Notes Comp. Sci, pp.308-322, 2006.

J. Rot, Coalgebraic minimization of automata by initiality and finality, Elect. Notes in Theor. Comp. Sci, vol.325, pp.253-276, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01487929

A. Silva, F. Bonchi, M. Bonsangue, and J. Rutten, Generalizing determinization from automata to coalgebras, Log. Meth. Comp. Sci, vol.9, issue.1, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909339

D. Turi and G. D. Plotkin, Towards a mathematical operational semantics, Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, pp.280-291, 1997.