What Monads Can and Cannot Do with a Few Extra Pages Rasmus Ejlers Møgelberg, Maaike Zwart, In Logical Methods in Computer Science (LMCS), Volume 21, Issue 4, 2025.
DOI (10.46298/lmcs-21(4:5)2025)
Modelling Recursion and Probabilistic Choice in Guarded Type Theory Philipp Stassen, Rasmus Ejlers Møgelberg, Maaike Annebet Zwart, Alejandro Aguirre, Lars Birkedal, In 52nd ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2025.
DOI (10.1145/3704884)
Correspondence between Composite Theories and Distributive Laws Aloïs Rosset, Maaike Zwart, Helle Hvid Hansen, and Jörg Endrullis, In 17th International Workshop on Coalgebraic Methods in Computer Science, CMCS24.
DOI (10.1007/978-3-031-66438-0_10)
What Monads Can and Cannot Do with a Bit of Extra Time Rasmus Møgelberg and Maaike Zwart, In 32nd EACSL Annual Conference on Computer Science Logic, CSL 2024.
DOI (10.4230/LIPIcs.CSL.2024.39).
No−Go Theorems for Distributive Laws (journal version) Maaike Zwart and Dan Marsden, In Logical Methods in Computer Science (LMCS), Special Issue: Selected papers of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science.
https://lmcs.episciences.org/8973
On the Non−Compositionality of Monads via Distributive Laws Maaike Zwart, PhD Thesis at the Department of Computer Science‚ University of Oxford. September, 2020.
Download pdf.
No−Go Theorems for Distributive Laws Maaike Zwart and Dan Marsden, In 34th Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2019.
DOI (10.1109/LICS.2019.8785707)
Quantitative Foundations for Resource Theories Dan Marsden and Maaike Zwart, In 27th EACSL Annual Conference on Computer Science Logic‚ CSL 2018.
DOI (10.4230/LIPIcs.CSL.2018.32)
Double Dilation ≠ Double Mixing (extended abstract) Maaike Zwart and Bob Coecke, In Proceedings of the 14th International Conference on Quantum Physics and Logic, QPL2017.
DOI (10.4204/EPTCS.266.9)
Maaike Zwart 