Weakening and Iterating Laws using String Diagrams
arXiv:2205.03640 · doi:10.46298/entics.10482
Abstract
Distributive laws are a standard way of combining two monads, providing a compositional approach for reasoning about computational effects in semantics. Situations where no such law exists can sometimes be handled by weakening the notion of distributive law, still recovering a composite monad. A celebrated result from Eugenia Cheng shows that combining monads is possible by iterating more distributive laws, provided they satisfy a coherence condition called the Yang-Baxter equation. Moreover, the order of composition does not matter, leading to a form of associativity. The main contribution of this paper is to generalise the associativity of iterated composition to weak distributive laws in the case of monads. To this end, we use string-diagrammatic notation, which significantly helps make increasingly complex proofs more readable. We also provide examples of new weak distributive laws arising from iteration.
arXiv commentConference version (proceedings of MFPS 2022)
References in corpus (8)
- Interacting Hopf Algebras
- The weak theory of monads
- Bialgebraic Semantics for Logic Programming
- Interacting Hopf Algebras: the theory of linear systems
- Category Theory Using String Diagrams
- On the 2-categories of weak distributive laws
- Compositional semantics for new paradigms: probabilistic, hybrid and beyond
- Semialgebras and Weak Distributive Laws