The Hidden Strength of Costrong Functors
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911157774712832 |
|---|---|
| author | Balan, Adriana Pantelimon, Silviu-George |
| author_facet | Balan, Adriana Pantelimon, Silviu-George |
| contents | Strong functors and monads are ubiquitous in Computer Science. More recently, comonads have demonstrated their use in structuring context-dependent notions of computation. However, the dualisation of ``being strong'' property passed somehow unobserved so far. We argue that ``being costrong'' gives a different understanding of how functors can interact with monoidal structures. This work in progress aims to explore costrong functors and their natural properties, with an eye towards the semantics of computations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_13026 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Hidden Strength of Costrong Functors Balan, Adriana Pantelimon, Silviu-George Logic in Computer Science Programming Languages Category Theory Strong functors and monads are ubiquitous in Computer Science. More recently, comonads have demonstrated their use in structuring context-dependent notions of computation. However, the dualisation of ``being strong'' property passed somehow unobserved so far. We argue that ``being costrong'' gives a different understanding of how functors can interact with monoidal structures. This work in progress aims to explore costrong functors and their natural properties, with an eye towards the semantics of computations. |
| title | The Hidden Strength of Costrong Functors |
| topic | Logic in Computer Science Programming Languages Category Theory |
| url | https://arxiv.org/abs/2509.13026 |