6 citations · 11 across the 7 of their papers we have counts for
7 papers
Modelling Recursion and Probabilistic Choice in Guarded Type Theory
Philipp Jan Andries Stassen, Rasmus Ejlers Møgelberg, Maaike Zwart +2
Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about oth…
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…
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…
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.…
Don't Try This at Home: No-Go Theorems for Distributive Laws
Maaike Zwart, Dan Marsden
Beck's distributive laws provide sufficient conditions under which two monads can be composed, and monads arising from distributive laws have many desirable theoretical properties.…
Double Dilation Double Mixing (extended abstract)
Maaike Zwart, Bob Coecke
Density operators are one of the key ingredients of quantum theory. They can be constructed in two ways: via a convex sum of 'doubled kets' (i.e. mixing), and by tracing out part o…
Double Dilation Double Mixing
Maaike Zwart, Bob Coecke
Density operators are one of the key ingredients of quantum theory. They can be constructed in two ways: via a convex sum of `doubled kets' (i.e. mixing), and by tracing out part o…