Monads need not be endofunctors

Thorsten Altenkirch, James Chapman, Tarmo Uustalu

Research output: Contribution to journalArticlepeer-review

32 Citations (Scopus)

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.

Original languageEnglish
Article number3
JournalLogical Methods in Computer Science
Volume11
Issue number1
DOIs
Publication statusPublished - 6 Mar 2015

Bibliographical note

Publisher Copyright:
© T. Altenkirch, J. Chapman, T. Uustalu.

Other keywords

  • Adjunctions
  • Hughes’s arrows
  • Monads
  • Monoids
  • Skew-monoidal categories

Fingerprint

Dive into the research topics of 'Monads need not be endofunctors'. Together they form a unique fingerprint.

Cite this