Recursive coalgebras from comonads

Venanzio Capretta*, Tarmo Uustalu, Varmo Vene

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


We discuss Osius's [22] 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.

Original languageEnglish
Pages (from-to)43-61
Number of pages19
JournalElectronic Notes in Theoretical Computer Science
Issue number1-4 SPEC. ISS.
Publication statusPublished - 12 Dec 2004

Bibliographical note

Funding 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: 3 Email: 4 Email:

Other keywords

  • Functor-coalgebra
  • Monad
  • Recursive coalgebra


Dive into the research topics of 'Recursive coalgebras from comonads'. Together they form a unique fingerprint.

Cite this