The concept of recursive coalgebra of a functor was introduced in the 1970s by Osius in his work on categorical set theory to discuss the relationship between wellfounded induction and recursively specified functions. In this paper, we motivate the use of recursive coalgebras as a paradigm of structured recursion in programming semantics, list some basic facts about recursive coalgebras and, centrally, give new conditions for the recursiveness of a coalgebra based on comonads, comonad-coalgebras and distributive laws of functors over comonads. We also present an alternative construction using countable products instead of cofree comonads. © 2006 Elsevier Inc. All rights reserved.
Capretta, V., Uustalu, T., & Vene, V. (2006). Recursive coalgebras from comonads. Information and Computation, 204(4), 437–468. https://doi.org/10.1016/j.ic.2005.08.005