Central Submonads and Notions of Computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

Central Submonads and Notions of Computation


The notion of "centre" has been introduced for many algebraic structures in mathematics. A notable example is the centre of a monoid which always determines a commutative submonoid. Monads (in category theory) can be seen as generalisations of monoids and in this paper we show how the notion of centre may be extended to strong monads acting on symmetric monoidal categories. We show that the centre of a strong monad T , if it exists, determines a commutative submonad Z of T , such that the Kleisli category of Z is isomorphic to the premonoidal centre (in the sense of Power and Robinson) of the Kleisli category of T . We provide three equivalent conditions which characterise the existence of the centre of T . While not every strong monad admits a centre, we show that every strong monad on well-known naturally occurring categories does admit a centre, thereby showing that this new notion is ubiquitous. We also provide a computational interpretation of our ideas which consists in giving a refinement of Moggi’s monadic metalanguage. The added benefit is that this allows us to immediately establish a large class of contextually equivalent terms for monads that admit a non-trivial centre by simply looking at the richer syntactic structure provided by the refinement.
Fichier principal
Vignette du fichier
central-submonads.pdf (717.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03662565 , version 1 (09-05-2022)
hal-03662565 , version 2 (11-05-2022)
hal-03662565 , version 3 (20-07-2022)


Attribution - CC BY 4.0


  • HAL Id : hal-03662565 , version 3


Titouan Carette, Louis Lemonnier, Vladimir Zamdzhiev. Central Submonads and Notions of Computation. 2022. ⟨hal-03662565v3⟩
199 View
134 Download


Gmail Facebook Twitter LinkedIn More