No Go Theorems: Directed Containers That Do Not Distribute Over Distribution Monads
Amin Karamlou, Nihil Shah
2024Year
Abstract
Monads and comonads are important constructions from category theory which find widespread application in computer science and other related disciplines. Distributive laws allow these constructions to interact compositionally. Such laws are not guaranteed to exist, and even when they do, finding them can be a difficult task.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- Monads and Distributive Laws in Substructural ContextsSoichiro Fujii, Yun Chen Tsai, Yoàv Montacute, Ichiro HasuoLICS 2026
- From Multisets over Distributions to Distributions over MultisetsBart JacobsLICS 2021 · 23 citations
- Central Submonads and Notions of Computation: Soundness, Completeness and Internal LanguagesTitouan Carette, Louis Lemonnier, Vladimir ZamdzhievLICS 2023 · 3 citations
- Combining probabilistic and non-deterministic choice via weak distributive lawsAlexandre Goy, Daniela PetrisanLICS 2020 · 30 citations
- Interaction Laws of Monads and ComonadsShin-ya Katsumata, Exequiel Rivas, Tarmo UustaluLICS 2020 · 10 citations
