Abstract
We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, untyped and typed λ-calculus syntax and indexed containers. We show that the Kleisli and Eilenberg-Moore constructions carry over to relative monads and are related to relative adjunctions. Under reasonable assumptions, relative monads are monoids in the functor category concerned and extend to monads, giving rise to a coreflection between monads and relative monads. Arrows are also an instance of relative monads. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Altenkirch, T., Chapman, J., & Uustalu, T. (2010). Monads need not be endofunctors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6014 LNCS, pp. 297–311). https://doi.org/10.1007/978-3-642-12032-9_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.