6 citations · 11 across the 7 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2024★ 1 cited
Correspondence between Composite Theories and Distributive Laws
Aloïs Rosset, Maaike Zwart, Helle Hvid Hansen +1
Composite theories are the algebraic equivalent of distributive laws. In this paper, we delve into the details of this correspondence and concretely show how to construct a composi…
cs.LO2023
What Monads Can and Cannot Do with a Few Extra Pages
Rasmus Ejlers Møgelberg, Maaike Zwart
The delay monad provides a way to introduce general recursion in type theory. To write programs that use a wide range of computational effects directly in type theory, we need to c…
cs.LO2020★ 6 cited
No-Go Theorems for Distributive Laws
Maaike Zwart, Dan Marsden
Monads are commonplace in computer science, and can be composed using Beck's distributive laws. Unfortunately, finding distributive laws can be extremely difficult and error-prone.…