Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Equational axiomatizability for coalgebra
Theoretical Computer Science
The generic approximation lemma
Information Processing Letters
A Discipline of Programming
Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Monads and Modular Term Rewriting
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Explicit substitutions and higher-order syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Substitution in non-wellfounded syntax with variable binding
Theoretical Computer Science - Selected papers of CMCS'03
Explicit substitutions and higher-order syntax
Higher-Order and Symbolic Computation
The category-theoretic solution of recursive program schemes
Theoretical Computer Science - Algebra and coalgebra in computer science
On the construction of free algebras for equational systems
Theoretical Computer Science
From Comodels to Coalgebras: State and Arrays
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher dimensional trees, algebraically
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Recursive Program Schemes and Context-Free Monads
Electronic Notes in Theoretical Computer Science (ENTCS)
The Recursion Scheme from the Cofree Recursive Comonad
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Equational systems and free constructions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
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.