Categories for collection monads
Mathematical Structures in Computer Science · 2026 · 36
DOI: 10.1017/s0960129526100486 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Structures in Computer Science, online erschienen am 04.03.2026. Verfasst von Eugenio Moggi. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Manes (1998). Implementing Collection Classes with Monads. Mathematical Structures in Computer Science 8 (231–276) introduced the notion of a collection monad on the category of sets as a suitable semantics for collection types. The canonical example of collection monad is the finite powerset monad. In order to account for the algorithmic aspects, the category of sets should be replaced with categories whose arrows are maps computable by low-complexity algorithms. Inspired by realizability, we give a systematic way for constructing categories of small sets and low-complexity functions and define an analogue of collection monads on such categories.
Zitieren
APA
Moggi, E. (2026). Categories for collection monads. Mathematical Structures in Computer Science, 36. https://doi.org/10.1017/s0960129526100486
Vancouver
Moggi E. Categories for collection monads. Mathematical Structures in Computer Science. 2026;36. doi:10.1017/s0960129526100486
BibTeX
@article{Moggi2026,
author = {Moggi, Eugenio},
title = {Categories for collection monads},
journal = {Mathematical Structures in Computer Science},
year = {2026},
volume = {36},
doi = {10.1017/s0960129526100486}
}
EUVIMED