default search action
Dylan McDermott
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Dylan McDermott
, Alan Mycroft:
Galois connecting call-by-value and call-by-name. Log. Methods Comput. Sci. 20(1) (2024) - 2022
- [j3]Shin-ya Katsumata
Flexible presentations of graded monads. Proc. ACM Program. Lang. 6(ICFP): 902-930 (2022) - [c10]Dylan McDermott
Sweedler Theory of Monads. FoSSaCS 2022: 428-448 - [c9]Dylan McDermott
Galois Connecting Call-by-Value and Call-by-Name. FSCD 2022: 32:1-32:19 - [c8]Dylan McDermott
A Type System with Subtyping for WebAssembly's Stack Polymorphism. ICTAC 2022: 305-323 - [c7]Dylan McDermott
Flexibly Graded Monads and Graded Algebras. MPC 2022: 102-128 - [c6]Flavien Breuvart, Dylan McDermott
Canonical Gradings of Monads. ACT 2022: 1-21 - [c5]Dylan McDermott
What Makes a Strong Monad? MSFP@ETAPS 2022: 113-133 - [i4]Dylan McDermott, Alan Mycroft:
Galois connecting call-by-value and call-by-name. CoRR abs/2202.08246 (2022) - 2021
- [c4]Nathanael Arkor
Abstract Clones for Abstract Syntax. FSCD 2021: 30:1-30:19 - [i3]Nathanael Arkor, Dylan McDermott:
Abstract clones for abstract syntax. CoRR abs/2105.00969 (2021) - 2020
- [c3]Dylan McDermott
Degrading Lists. PPDP 2020: 6:1-6:14
2010 – 2019
- 2019
- [b1]Dylan McDermott:
Reasoning about effectful programs and evaluation order. University of Cambridge, UK, 2019 - [c2]Dylan McDermott
Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order. ESOP 2019: 235-262 - 2018
- [j2]Dylan McDermott
Call-by-need effects via coeffects. Open Comput. Sci. 8(1): 93-108 (2018) - [c1]Ohad Kammar, Dylan McDermott
Factorisation Systems for Logical Relations and Monadic Lifting in Type-and-effect System Semantics. MFPS 2018: 239-260 - [i2]Ohad Kammar, Dylan McDermott:
Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics. CoRR abs/1804.03460 (2018) - 2017
- [j1]Matthew J. Parkinson, Dimitrios Vytiniotis, Kapil Vaswani, Manuel Costa, Pantazis Deligiannis
Project snowflake: non-blocking safe manual memory management in .NET. Proc. ACM Program. Lang. 1(OOPSLA): 95:1-95:25 (2017) - [i1]Ohad Kammar, Dylan McDermott:
A monadic solution to the Cartwright-Felleisen-Wadler conjecture. CoRR abs/1707.06685 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: