From Comodels to Coalgebras: State and Arrays

We investigate the notion of a comodel of a (countable) Lawvere theory, an evident dual to the notion of model. By taking the forgetful functor from the category of comodels to Set, every (countable) Lawvere theory generates a comonad on Set. But while Lawvere theories are equivalent to finitary monads on Set, and that result extends to higher cardinality, no such result holds for comonads, and that is not only for size reasons: it is primarily because, while Set is cartesian closed, Set^o^p is not. So every monad with rank on Set generates a comonad on Set, but not conversely. Our leading example is given by the countable Lawvere theory for global state: its category of comodels is the category of arrays, yielding a precise relationship between global state and arrays. Restricting from arbitrary comonads to those comonads generated by Lawvere theories allows us to study new and interesting constructions, in particular that of tensor product.

[1]  Don Syme,et al.  A Theory of Finite Maps , 1995, TPHOLs.

[2]  Frank J. Oles,et al.  Type Algebras, Functor Categories, and Block Structure , 1986 .

[3]  John Power,et al.  Symmetric monoidal sketches , 2000, PPDP '00.

[4]  G. M. Kelly,et al.  BASIC CONCEPTS OF ENRICHED CATEGORY THEORY , 2022, Elements of ∞-Category Theory.

[5]  Gordon D. Plotkin,et al.  Combining Computational Effects: commutativity & sum , 2002, IFIP TCS.

[6]  Martin Hofmann,et al.  Positive Subtyping , 1996, Inf. Comput..

[7]  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.

[8]  Gordon D. Plotkin,et al.  Combining effects: Sum and tensor , 2006, Theor. Comput. Sci..

[9]  John Power,et al.  Combining continuations with other effects , 2004 .

[10]  John Power,et al.  Combining computational effects: commutativity and sum , 2001 .

[11]  Eduardo J. Dubuc,et al.  Kan Extensions in Enriched Category Theory , 1970 .

[12]  G. M. Kelly,et al.  Two-dimensional monad theory , 1989 .

[13]  John Power Enriched Lawvere Theories , .

[14]  Gordon D. Plotkin,et al.  Notions of Computation Determine Monads , 2002, FoSSaCS.

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

[16]  P. T. Johnstone,et al.  TOPOSES, TRIPLES AND THEORIES (Grundlehren der mathematischen Wissenschaften 278) , 1986 .

[17]  Christoph Lüth,et al.  Algebras, Coalgebras, Monads and Comonads , 2001, CMCS.

[18]  John C. Reynolds,et al.  Algebraic Methods in Semantics , 1985 .

[19]  David L. Dill,et al.  A decision procedure for an extensional theory of arrays , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[20]  Christoph Lüth,et al.  Dualising Initial Algebras , 2003, Math. Struct. Comput. Sci..