Monads need not be endofunctors
- Submitting institution
-
University of Nottingham, The
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1334627
- Type
- D - Journal article
- DOI
-
10.2168/LMCS-11%281%3A3%292015
- Title of journal
- Logical Methods in Computer Science
- Article number
- -
- First page
- 1
- Volume
- 11
- Issue
- 1:3
- ISSN
- 1860-5974
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 15
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Monads are one of the most frequently used patterns in typed functional programming. However, in the context of dependent types we frequently encounter monad like structures that don't fit the classical definition, because the source and target don't agree (they are not endofunctors). To address this issue we develop the theory of relative monads and show that this subsumes a number of previously considered notions (e.g. arrows) .The field medalist Vladimir Voevodsky's comment on this work was ""cool paper"" and the citation record shows that the community has adopted this notion.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
