A monadic solution to the Cartwright-Felleisen-Wadler conjecture. - Ohad Kammar; Dylan McDermott (CoRR, 2017)

Project snowflake: non-blocking safe manual memory management in .NET. - Matthew J. Parkinson; Dimitrios Vytiniotis; Kapil Vaswani; Manuel Costa; Pantazis Deligiannis; Dylan McDermott; Aaron Blankstein; Jonathan Balkind (Proc. ACM Program. Lang., 2017)

Call-by-need effects via coeffects. - Dylan McDermott; Alan Mycroft (Open Comput. Sci., 2018)

Factorisation Systems for Logical Relations and Monadic Lifting in Type-and-effect System Semantics. - Ohad Kammar; Dylan McDermott (MFPS, 2018)

Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order. - Dylan McDermott; Alan Mycroft (ESOP, 2019)

Reasoning about effectful programs and evaluation order. - Dylan McDermott (2019)

Degrading Lists. - Dylan McDermott; Maciej Piróg; Tarmo Uustalu (PPDP, 2020)

Abstract Clones for Abstract Syntax. - Nathanael Arkor; Dylan McDermott (FSCD, 2021)

Sweedler Theory of Monads. - Dylan McDermott; Exequiel Rivas; Tarmo Uustalu (FoSSaCS, 2022)

A Type System with Subtyping for WebAssembly's Stack Polymorphism. - Dylan McDermott; Yasuaki Morita; Tarmo Uustalu (ICTAC, 2022)

Flexibly Graded Monads and Graded Algebras. - Dylan McDermott; Tarmo Uustalu (MPC, 2022)

What Makes a Strong Monad? - Dylan McDermott; Tarmo Uustalu (MSFP@ETAPS, 2022)

Canonical Gradings of Monads. - Flavien Breuvart; Dylan McDermott; Tarmo Uustalu (ACT, 2022)

Flexible presentations of graded monads. - Shin-ya Katsumata; Dylan McDermott; Tarmo Uustalu; Nicolas Wu (Proc. ACM Program. Lang., 2022)

Galois connecting call-by-value and call-by-name. - Dylan McDermott; Alan Mycroft (Log. Methods Comput. Sci., 2024)

Grading Call-By-Push-Value, Explicitly and Implicitly. - Dylan McDermott (FSCD, 2025)