Monads need not be endofunctors

Altenkirch, Thorsten and Chapman, James and Uustalu, Tarmo (2015) Monads need not be endofunctors. Logical Methods in Computer Science, 11 (1:3). pp. 1-40. ISSN 1860-5974

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution No Derivatives.
Download (495kB) | Preview

Abstract

We introduce a generalization 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 relative monads and monads. Arrows are also an instance of relative monads.

Item Type: Article
Keywords: monads, adjunctions, monoids, skew-monoidal categories, functional programming
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.2168/LMCS-11(1:3)2015
Depositing User: Altenkirch, Thorsten
Date Deposited: 12 Oct 2015 12:34
Last Modified: 13 Sep 2016 15:01
URI: http://eprints.nottingham.ac.uk/id/eprint/30436

Actions (Archive Staff Only)

Edit View Edit View