Abstract
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 language | English |
---|---|
Pages (from-to) | 43-61 |
Number of pages | 19 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 107 |
Issue number | 1-4 SPEC. ISS. |
DOIs | |
Publication status | Published - 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: [email protected] 3 Email: [email protected] 4 Email: [email protected]
Other keywords
- Functor-coalgebra
- Monad
- Recursive coalgebra