Partiality and Container Monads
- Tarmo Uustalu,
- Niccolò Veltri
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOpen access
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 406-425 (20 pages)Publication milestones
- Published - 2017
Publication status
Published - 2017
Place of publication
ChamPublisher
Springer, United States, GermanyBook series
- Book series name: Lecture Notes in Computer Science
Volume: 10695
ISSN: 0302-9743
ISBN (Print)
978-3-319-71237-6Publication IDs
- Scopus: 85035057965
Host publication title
Programming Languages and Systems: 15th Asian Symposium, APLAS 2017, Suzhou, China, November 27-29, 2017, ProceedingsHost publication editors
- Bor-Yuh Evan Chang
Abstract
We investigate monads of partiality in Martin-Löf type theory, following Moggi’s general monad-based method for modelling effectful computations. These monads are often called lifting monads and appear in category theory with different but related definitions. In this paper, we unveil the relationship between containers and lifting monads. We show that the lifting monads usually employed in type theory can be specified in terms of containers. Moreover, we give a precise characterization of containers whose interpretations carry a lifting monad structure. We show that these conditions are tightly connected with Rosolini’s notion of dominance. We provide several examples, putting particular emphasis on Capretta’s delay monad and its quotiented variant, the non-termination monad.
Publication metrics
PlumX, opens in new tab
Citations
3
Captures
4
Access to documents
Accepted author manuscript, 340.89 KB
Related Event
Title
Asian Symposium on Programming Languages and Systems
