Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917049518784512 |
|---|---|
| author | Carette, TItouan Lemonnier, Louis Zamdzhiev, Vladimir |
| author_facet | Carette, TItouan Lemonnier, Louis Zamdzhiev, Vladimir |
| contents | Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute with all other effects, may be formulated for strong monads acting on symmetric monoidal categories. We identify three equivalent conditions which characterise the existence of the centre of a strong monad (some of which relate it to the premonoidal centre of Power and Robinson) and we show that every strong monad on many well-known naturally occurring categories does admit a centre, thereby showing that this new notion is ubiquitous. More generally, we study central submonads, which are necessarily commutative, just like the centre of a strong monad. We provide a computational interpretation by formulating equational theories of lambda calculi equipped with central submonads, we describe categorical models for these theories and prove soundness, completeness and internal language results for our semantics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2207_09190 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages Carette, TItouan Lemonnier, Louis Zamdzhiev, Vladimir Logic in Computer Science Programming Languages Category Theory Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute with all other effects, may be formulated for strong monads acting on symmetric monoidal categories. We identify three equivalent conditions which characterise the existence of the centre of a strong monad (some of which relate it to the premonoidal centre of Power and Robinson) and we show that every strong monad on many well-known naturally occurring categories does admit a centre, thereby showing that this new notion is ubiquitous. More generally, we study central submonads, which are necessarily commutative, just like the centre of a strong monad. We provide a computational interpretation by formulating equational theories of lambda calculi equipped with central submonads, we describe categorical models for these theories and prove soundness, completeness and internal language results for our semantics. |
| title | Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages |
| topic | Logic in Computer Science Programming Languages Category Theory |
| url | https://arxiv.org/abs/2207.09190 |