J. Adámek, Free algebras and automata realizations in the language of categories, Comment . Math. Univ. Carolin, vol.15, pp.589-602, 1974.

J. Adámek, S. Milius, and J. Velebil, Equational properties of iterative monads, Information and Computation, vol.208, issue.12, pp.1306-1348, 2010.
DOI : 10.1016/j.ic.2009.10.006

J. Adámek, S. Milius, and J. Velebil, Elgot theories: a new perspective on the equational properties of iteration, Mathematical Structures in Computer Science, vol.221, issue.02, pp.417-480, 2011.
DOI : 10.1016/S0304-3975(01)00242-0

J. Adámek and H. E. Porst, On tree coalgebras and coalgebra presentations, Theoretical Computer Science, vol.311, issue.1-3, pp.257-283, 2004.
DOI : 10.1016/S0304-3975(03)00378-5

K. Asada, S. Hidaka, H. Kato, Z. Hu, and K. Nakano, A parameterized graph transformation calculus for finite graphs with monadic branches, Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP '13, pp.73-84, 2013.
DOI : 10.1145/2505879.2505903

A. Balan and A. Kurz, On coalgebras over algebras, Theoretical Computer Science, vol.412, issue.38, pp.4989-5005, 2011.
DOI : 10.1016/j.tcs.2011.03.021

M. Barr, Coequalizers and free triples, Mathematische Zeitschrift, vol.12, issue.4, pp.307-322, 1970.
DOI : 10.1007/BF01111838

S. L. Bloom and Z. Esik, Iteration Theories: the equational logic of iterative processes, EATCS Monographs on Theoretical Computer Science, 1993.

M. M. Bonsangue, H. H. Hansen, A. Kurz, and J. Rot, Presenting distributive laws, Heckel and Milius [15], pp.95-109
DOI : 10.1007/978-3-642-40206-7_9

P. J. Freyd, Remarks on algebraically compact categories, 1992.
DOI : 10.1017/CBO9780511525902.006

F. Gadducci and U. Montanari, The tile model, Proof, Language, and Interaction, pp.133-166, 2000.

I. Hasuo, B. Jacobs, and A. Sokolova, Generic Forward and Backward Simulations, (Partly in Japanese) Proceedings of JSSST Annual Meeting, 2006.
DOI : 10.1007/11817949_27

I. Hasuo, B. Jacobs, and A. Sokolova, Generic Trace Semantics via Coinduction, Logical Methods in Computer Science, vol.3, issue.4, pp.1-36, 2007.
DOI : 10.2168/LMCS-3(4:11)2007
URL : http://arxiv.org/abs/0710.2505

P. Johnstone, Adjoint Lifting Theorems for Categories of Algebras, Bulletin of the London Mathematical Society, vol.7, issue.3, pp.294-297, 1975.
DOI : 10.1112/blms/7.3.294

G. M. Kelly, A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on, Bulletin of the Australian Mathematical Society, vol.221, issue.01, pp.1-83, 1980.
DOI : 10.1007/BF01111838

A. Mazurkiewicz, Concurrent Program Schemes and their Interpretations, DAIMI Report Series, vol.6, issue.78, p.78, 1977.
DOI : 10.7146/dpb.v6i78.7691

M. Lane and S. , Categories for the Working Mathematician, 1971.
DOI : 10.1007/978-1-4612-9839-7

S. Milius, T. Palm, and D. Schwencke, Complete Iterativity for Algebras with Effects, Proc. CALCO'09, pp.34-48, 2009.
DOI : 10.1016/0304-3975(80)90056-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.566.6071

P. S. Mulry and . Brookes, Lifting theorems for Kleisli categories, pp.304-319
DOI : 10.1007/3-540-58027-1_15

A. M. Rabinovich and . Brookes, A complete axiomatisation for trace congruence of finite state behaviors, pp.530-543
DOI : 10.1007/3-540-58027-1_25

A. Silva and B. Westerbaan, A Coalgebraic View of ??-Transitions, Heckel and Milius [15], pp.267-281
DOI : 10.1007/978-3-642-40206-7_20

P. Soboci´nskisoboci´nski, Relational presheaves as labelled transition systems, Proc. Coalgebraic Methods in Computer Science (CMCS'12), pp.40-50, 2012.

D. Turi and G. Plotkin, Towards a mathematical operational semantics, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997.
DOI : 10.1109/LICS.1997.614955
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.730