Dualising initial algebras. Coalgebraic methods in computer science (Genova, 2001)
Ghani, N., Lüth, C., De Marchi, F. and Power, J., 2003. Dualising initial algebras. Coalgebraic methods in computer science (Genova, 2001). Mathematical Structures in Computer Science, 13 (2), pp. 349-370.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
Whilst the relationship between initial algebras and monads is well understood, the relationship between final coalgebras and comonads is less well explored. This paper shows that the problem is more subtle than might appear at first glance: final coalgebras can form monads just as easily as comonads, and, dually, initial algebras form both monads and comonads. 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 first defining a notion of cosignature and coequation and then proving that the models of such coalgebraic presentations are precisely the coalgebras of the representing comonad.
|Creators||Ghani, N., Lüth, C., De Marchi, F. and Power, J.|
|Departments||Faculty of Science > Computer Science|
Actions (login required)