nLab Dylan McDermott

Selected writings

personal page

Selected writings

On strong monads in computer science:

Dylan McDermott, Tarmo Uustalu, What Makes a Strong Monad?, EPTCS 360 (2022) 113-133 [arXiv:2207.00851, doi:10.4204/EPTCS.360.6]

On graded monads in computer science as enriched relative monads (and on locally graded categories):

Dylan McDermott, Tarmo Uustalu. Flexibly graded monads and graded algebras, in: Mathematics of Program Construction MPC 2022, Lecture Notes in Computer Science 13544, Springer (2022) [doi:10.1007/978-3-031-16912-0_4]

On formal theory of relative monads via virtual equipments:

Nathanael Arkor, Dylan McDermott, The formal theory of relative monads [arXiv:2302.14014]
Nathanael Arkor, Dylan McDermott, Relative monadicity (2023) [arXiv:2305.10405]

category: people

Last revised on October 14, 2023 at 06:54:06. See the history of this page for a list of all contributions to it.