dc.contributor |
Reykjavik University |
dc.contributor |
Háskólinn í Reykjavík |
dc.contributor.author |
McDermott, Dylan |
dc.contributor.author |
Piróg, Maciej |
dc.contributor.author |
Uustalu, Tarmo |
dc.date.accessioned |
2023-02-21T14:27:29Z |
dc.date.available |
2023-02-21T14:27:29Z |
dc.date.issued |
2020-09-08 |
dc.identifier.citation |
D. McDermott, M. Piróg, T. Uustalu. Degrading lists. In 22nd International Symposium on Principles and Practice of Declarative Programming (PPDP ’20), September 8–10, 2020, Bologna, Italy, art. 6, 14 pp. ACM, New York, 2020. doi:10.1145/3414080.3414084 |
dc.identifier.isbn |
978-1-4503-8821-4 |
dc.identifier.uri |
https://hdl.handle.net/20.500.11815/4018 |
dc.description |
Post-print (lokagerð höfundar) |
dc.description.abstract |
We discuss the relationship between monads and their known generalisation, graded monads, which are especially useful for modelling computational effects equipped with a form of sequential composition. Specifically, we ask if a graded monad can be extended to a monad, and when such a degrading is in some sense canonical. Our particular examples are the graded monads of lists and non-empty lists indexed by their lengths, which gives us a pretext to study the space of all (non-graded) monad structures on the list and non-empty list endofunctors. We show that, in both cases, there exist infinitely many monad structures. However, while there are at least two ways to complete the graded monad structure on length-indexed lists to a monad structure on the list endofunctor, such a completion for non-empty lists is unique. |
dc.description.sponsorship |
This research was supported by the Icelandic Research Fund project grant no. 196323-052. T.U. was also supported by the Estonian Ministry of Education and Research institutional research grant no. IUT33-13. |
dc.format.extent |
article 6 |
dc.language.iso |
en |
dc.publisher |
ACM |
dc.relation.ispartofseries |
ACM International Conference Proceeding Series; |
dc.rights |
info:eu-repo/semantics/openAccess |
dc.subject |
Monads |
dc.subject |
Algebraic theories |
dc.subject |
Graded monads |
dc.subject |
Degrading |
dc.subject |
Lists |
dc.subject |
Theory of computation |
dc.subject |
Functional constructs |
dc.subject |
Program semantics |
dc.subject |
Algebra |
dc.subject |
Merkingarfræði |
dc.subject |
Tölvunafræði |
dc.title |
Degrading lists |
dc.type |
info:eu-repo/semantics/bookPart |
dc.description.version |
Peer reviewed (ritrýnd grein) |
dc.identifier.journal |
22nd International Symposium on Principles and Practice of Declarative Programming (PPDP '20) |
dc.identifier.doi |
10.1145/3414080.3414084 |
dc.contributor.department |
Department of Computer Science |
dc.contributor.department |
Tölvunarfræðideild (HR) |
dc.contributor.school |
School of Technology (RU) |
dc.contributor.school |
Tæknisvið (HR) |