Whilst the relationship between initial algebras and monads is well-understood, the relationship between final coalgebras and previous termcomonadsnext term is less well explored. This paper shows that the problem is more subtle and that final coalgebras can just as easily form monads as previous termcomonads and dually, that initial algebras form both monads and previous termcomonads.
In developing these theories we strive to provide them with an associated notion of syntax. In the case of initial algebras and monads this corresponds to the standard notion of algebraic theories consisting of signatures and equations: models of such algebraic theories are precisely the algebras of the representing monad. We attempt to emulate this result for the coalgebraic case by defining a notion cosignature and coequation and then proving the models of this syntax are precisely the coalgebras of the representing comonad.
|Number of pages||18|
|Journal||Electronic Notes in Theoretical Computer Science|
|Publication status||Published - 2001|