Coherence for monoidal endofunctors
From MaRDI portal
Publication:3583019
DOI10.1017/S0960129510000022zbMATH Open1204.18001arXiv0907.2194OpenAlexW2963189214MaRDI QIDQ3583019FDOQ3583019
Authors: Kosta Došen, Zoran Petrić 
Publication date: 26 August 2010
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Abstract: The goal of this paper is to prove coherence results with respect to relational graphs for monoidal endofunctors, i.e. endofunctors of a monoidal category that preserve the monoidal structure up to a natural transformation that need not be an isomorphism. These results are proved first in the absence of symmetry in the monoidal structure, and then with this symmetry. In the later parts of the paper the coherence results are extended to monoidal endofunctors in monoidal categories that have diagonal or codiagonal natural transformations, or where the monoidal structure is given by finite products or coproducts. Monoidal endofunctors are interesting because they stand behind monoidal monads and comonads, for which coherence will be proved in a sequel to this paper.
Full work available at URL: https://arxiv.org/abs/0907.2194
Recommendations
Cites Work
- Title not available (Why is that?)
- Notions of computation and monads
- Monads on symmetric monoidal closed categories
- Strong functors and monoidal monads
- Hopf monads
- Functors between tensored categories
- Monads on tensor categories
- Coherence in substructural categories
- Coherence in closed categories
- Closed categories, star-autonomy, and monoidal comonads
Cited In (1)
This page was built for publication: Coherence for monoidal endofunctors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583019)
