{"docId":928,"paperId":928,"url":"https:\/\/lmcs.episciences.org\/928","doi":"10.2168\/LMCS-11(1:3)2015","journalName":"Logical Methods in Computer Science","issn":"","eissn":"1860-5974","volume":[{"vid":152,"name":"Volume 11, Issue 1"}],"section":[],"repositoryName":"arXiv","repositoryIdentifier":"1412.7148","repositoryVersion":2,"repositoryLink":"https:\/\/arxiv.org\/abs\/1412.7148v2","dateSubmitted":"2011-05-04 00:00:00","dateAccepted":"2015-06-25 11:46:15","datePublished":"2015-03-06 00:00:00","titles":["Monads need not be endofunctors"],"authors":["Altenkirch, Thosten","Chapman, James","Uustalu, Tarmo"],"abstracts":["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 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."],"keywords":["Computer Science - Programming Languages","Computer Science - Logic in Computer Science","Mathematics - Category Theory"]}