Free algebras and automata realizations in the language of categories, Comment. Math. Univ. Carolinae, vol.15, pp.589-602, 1974. ,
Fixed Points of Set Functors: How Many Iterations are Needed?, Applied Categorical Structures, vol.338, issue.5 ,
DOI : 10.1007/s10485-016-9451-1
Initial algebras and terminal coalgebras ,
Well-Pointed Coalgebras, Logical Methods in Computer Science, vol.9, issue.3, pp.1-51, 2013. ,
DOI : 10.2168/LMCS-9(3:2)2013
Iterative algebras at work, Mathematical Structures in Computer Science, vol.16, issue.06, pp.1085-1131, 2006. ,
DOI : 10.1017/S0960129506005706
Initial algebras and terminal coalgebras in many-sorted sets, Mathematical Structures in Computer Science, vol.12, issue.02, pp.481-509, 2011. ,
DOI : 10.1016/j.tcs.2004.12.009
Terminal coalgebras in well-founded set theory, Theoretical Computer Science, vol.114, issue.2, pp.182-192, 1994. ,
DOI : 10.1016/0304-3975(93)90076-6
A Sound and Complete Calculus for Finite Stream Circuits, 2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010. ,
DOI : 10.1109/LICS.2010.11
Categorical set theory: A characterization of the category of sets, Journal of Pure and Applied Algebra, vol.4, issue.1, pp.79-119, 1974. ,
DOI : 10.1016/0022-4049(74)90032-2
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
The Category-Theoretic Solution of Recursive Domain Equations, SIAM Journal on Computing, vol.11, issue.4, pp.761-783, 1982. ,
DOI : 10.1137/0211062
Towards a unified treatment of induction i: the general recursion theorem . preprint (1995?6), see http ,
Free algebras, input processes and free monads, Comment. Math. Univ. Carolinae, vol.16, pp.339-351, 1975. ,
On the final sequence of a finitary set functor, Theoretical Computer Science, vol.338, issue.1-3, p.338, 2005. ,
DOI : 10.1016/j.tcs.2004.12.009