The costructure-cosemantics adjunction for comodels for computational effects

by   Richard Garner, et al.

It is well established that equational algebraic theories, and the monads they generate, can be used to encode computational effects. An important insight of Power and Shkaravska is that comodels of an algebraic theory T – i.e., models in the opposite category Set^op – provide a suitable environment for evaluating the computational effects encoded by T. As already noted by Power and Shkaravska, taking comodels yields a functor from accessible monads to accessible comonads on Set. In this paper, we show that this functor is part of an adjunction – the "costructure-cosemantics adjunction" of the title – and undertake a thorough investigation of its properties. We show that, on the one hand, the cosemantics functor takes its image in what we term the presheaf comonads induced by small categories; and that, on the other, costructure takes its image in the presheaf monads induced by small categories. In particular, the cosemantics comonad of an accessible monad will be induced by an explicitly-described category called its behaviour category that encodes the static and dynamic properties of the comodels. Similarly, the costructure monad of an accessible comonad will be induced by a behaviour category encoding static and dynamic properties of the comonad coalgebras. We tie these results together by showing that the costructure-cosemantics adjunction is idempotent, with fixpoints to either side given precisely by the presheaf monads and comonads. Along the way, we illustrate the value of our results with numerous examples drawn from computation and mathematics.


page 1

page 2

page 3

page 4


Category-Graded Algebraic Theories and Effect Handlers

We provide an effect system CatEff based on a category-graded extension ...

Central Submonads and Notions of Computation

The notion of "centre" has been introduced for many algebraic structures...

Globular weak ω-categories as models of a type theory

We study the dependent type theory CaTT, introduced by Finster and Mimra...

Finitely accessible arboreal adjunctions and Hintikka formulae

Arboreal categories provide an axiomatic framework in which abstract not...

Dynamic categories, dynamic operads: From deep learning to prediction markets

Natural organized systems adapt to internal and external pressures and t...

Strictly Associative and Unital ∞-Categories as a Generalized Algebraic Theory

We present the first definition of strictly associative and unital ∞-cat...

Space-time tradeoffs of lenses and optics via higher category theory

Optics and lenses are abstract categorical gadgets that model systems wi...

Please sign up or login with your details

Forgot password? Click here to reset