LIPIcs.TYPES.2013.1.pdf
- Filesize: 0.52 MB
- 23 pages
Document
Update Monads: Cointerpreting Directed Containers
Authors
-
Part of:
Volume:
19th International Conference on Types for Proofs and Programs (TYPES 2013)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Types for Proofs and Programs (TYPES) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2014-07-25
Cite AsGet BibTex
Danel Ahman and Tarmo Uustalu. Update Monads: Cointerpreting Directed Containers. In 19th International Conference on Types for Proofs and Programs (TYPES 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 26, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/LIPIcs.TYPES.2013.1
https://doi.org/10.4230/LIPIcs.TYPES.2013.1
Abstract
We introduce update monads as a generalization of state monads. Update
monads are the compatible compositions of reader and writer monads
given by a set and a monoid. Distributive laws between such monads are
given by actions of the monoid on the set.
We also discuss a dependently typed generalization of update monads. Unlike simple update monads, they cannot be factored into a reader and writer monad, but rather into similarly looking relative monads.
Dependently typed update monads arise from cointerpreting directed
containers, by which we mean an extension of an interpretation of the
opposite of the category of containers into the category of set
functors.
Keywords
- monads and distributive laws
- reader
- writer and state monads
- monoids and monoid actions
- directed containers
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads