Monads need not be endofunctors

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 lambda-calculus syntax and indexed containers. We show that the Kleisli and Eilenberg-Moore constructio...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 11, Issue 1
Main Authors:	Altenkirch, Thosten, Chapman, James, Uustalu, Tarmo
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 06.03.2015
Subjects:	computer science - logic in computer science computer science - programming languages mathematics - category theory
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!