Relating Idioms, Arrows and Monads from Monoidal Adjunctions
Programming Languages
2018-07-12 v1 Logic in Computer Science
Abstract
We revisit once again the connection between three notions of computation: monads, arrows and idioms (also called applicative functors). We employ monoidal categories of finitary functors and profunctors on finite sets as models of these notions of computation, and develop the connections between them through adjunctions. As a result, we obtain a categorical version of Lindley, Yallop and Wadler's characterisation of monads and idioms as arrows satisfying an isomorphism.
Keywords
Cite
@article{arxiv.1807.04084,
title = {Relating Idioms, Arrows and Monads from Monoidal Adjunctions},
author = {Exequiel Rivas},
journal= {arXiv preprint arXiv:1807.04084},
year = {2018}
}
Comments
In Proceedings MSFP 2018, arXiv:1807.03732