Name
Abstract | ||
|---|---|---|
The goal of this paper is to prove coherence results with respect to relational graphs for monoidal monads and comonads, that is, monads and comonads in a monoidal category such that the endofunctor of the monad or comonad is a monoidal functor (this means that it preserves 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. The monoidal structure is also allowed to be given with finite products or finite coproducts. Monoidal comonads with finite products axiomatise a plausible notion of equality of deductions in a fragment of the modal logic S4. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1017/S0960129510000034 | Mathematical Structures in Computer Science |
Keywords | Field | DocType |
category theory,modal logic,natural transformation | Closed monoidal category,Discrete mathematics,Topology,Monoidal functor,Enriched category,Monad (category theory),Monoidal category,Algebra,Symmetric monoidal category,Higher category theory,Monad (functional programming),Mathematics | Journal |
Volume | Issue | ISSN |
20 | 4 | 0960-1295 |
Citations | PageRank | References |
1 | 0.47 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kosta Dosen | 1 | 143 | 25.45 |
| Zoran Petric | 2 | 40 | 10.82 |