Dualising Initial Algebras

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.

[1]  Gordon D. Plotkin,et al.  Abstract syntax and variable binding , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[2]  Lawrence S. Moss,et al.  Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[3]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[4]  Christoph Lüth.  Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem , 1996, RTA.

[5]  G. Kelly.  A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on , 1980, Bulletin of the Australian Mathematical Society.

[6]  Edmund Robinson.  Variations on Algebra: Monadicity and Generalisations of Equational Therories , 2002, Formal Aspects of Computing.

[7]  D. Turi,et al.  Functional Operational Semantics and its Denotational Dual , 1996 .

[8]  G. Winskel.  The formal semantics of programming languages , 1993 .

[9]  G. M. Kelly,et al.  A presentation of topoi as algebraic relative to categories or graphs , 1983 .

[10]  Jiří Adámek,et al.  From Varieties of Algebras to Covarieties of Coalgebras , 2001, CMCS.

[11]  Michael Makkai,et al.  Accessible categories: The foundations of categorical model theory, , 2007 .

[12]  Graham Hutton,et al.  The generic approximation lemma , 2001, Inf. Process. Lett..

[13]  Christoph Lüth,et al.  Monads and Modular Term Rewriting , 1997, Category Theory and Computer Science.

[14]  James Worrell,et al.  On the structure of categories of coalgebras , 2001, Theor. Comput. Sci..

[15]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[16]  Grigore Rosu.  Equational axiomatizability for coalgebra , 2001, Theor. Comput. Sci..

[17]  Corina Cîrstea,et al.  An Algebra-Coalgebra Framework for System Specification , 2000, CMCS.

[18]  Jirí Adámek,et al.  On final coalgebras of continuous functors , 2003, Theor. Comput. Sci..

[19]  G. M. Kelly.  Elementary observations on 2-categorical limits , 1989, Bulletin of the Australian Mathematical Society.

[20]  Peter Aczel,et al.  A Coalgebraic View of Infinite Trees and Iteration , 2001, CMCS.

[21]  James Worrell,et al.  Terminal sequences for accessible endofunctors , 1999, CMCS.

[22]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[23]  G. M. Kelly,et al.  Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads , 1993 .