We discuss Osius's  concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiveness of a functor-coalgebra that are based on comonads, comonad-coalgebras and distributive laws.
Bibliographical noteFunding Information:
★ Research supported by the Estonian-French scientific cooperation programme Parrot and by the Estonian Science Foundation under grant No. 5567. 1 Previously at INRIA Sophia Antipolis, 2004 route des Lucioles, BP 93, F-06902 Sophia Antipolis, France. 2 Email: firstname.lastname@example.org 3 Email: email@example.com 4 Email: firstname.lastname@example.org
- Recursive coalgebra