Natural Transformations as Rewrite Rules and Monad Composition
Eklund et al. (2002) present a graphical technique aimed at simplifying the verification of various category-theoretic constructions, notably the composition of monads. In this note we take a different approach involving string rewriting. We show that a given tuple $(T,\mu,\eta)$ is a monad if and o...
| Auteur principal: | |
|---|---|
| Format: | Article |
| Langue: | English |
| Publié: |
Logical Methods in Computer Science e.V.
2019-01-01
|
| Collection: | Logical Methods in Computer Science |
| Sujets: | |
| Accès en ligne: | https://lmcs.episciences.org/2609/pdf |