{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T20:46:24Z","timestamp":1773434784340,"version":"3.50.1"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,3,6]],"date-time":"2015-03-06T00:00:00Z","timestamp":1425600000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce a generalization of monads, called relative monads, allowing for\nunderlying functors between different categories. Examples include\nfinite-dimensional vector spaces, untyped and typed lambda-calculus syntax and\nindexed containers. We show that the Kleisli and Eilenberg-Moore constructions\ncarry over to relative monads and are related to relative adjunctions. Under\nreasonable assumptions, relative monads are monoids in the functor category\nconcerned and extend to monads, giving rise to a coreflection between relative\nmonads and monads. Arrows are also an instance of relative monads.<\/jats:p>","DOI":"10.2168\/lmcs-11(1:3)2015","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T07:33:27Z","timestamp":1431934407000},"source":"Crossref","is-referenced-by-count":37,"title":["Monads need not be endofunctors"],"prefix":"10.46298","volume":"Volume 11, Issue 1","author":[{"given":"Thosten","family":"Altenkirch","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9036-8252","authenticated-orcid":false,"given":"James","family":"Chapman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1297-0579","authenticated-orcid":false,"given":"Tarmo","family":"Uustalu","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2015,3,6]]},"reference":[{"key":"614:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/928\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/928\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:59:16Z","timestamp":1681243156000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,6]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(1:3)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1412.7148","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1412.7148","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,6]]},"article-number":"928"}}