default search action
Max S. New
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Max S. New
, Eric Giovannini
Gradual Typing for Effect Handlers. Proc. ACM Program. Lang. 7(OOPSLA2): 1758-1786 (2023) - [c7]Max S. New
A Formal Logic for Formal Category Theory. FoSSaCS 2023: 113-134 - [i6]Max S. New, Eric Giovannini, Daniel R. Licata:
Gradual Typing for Effect Handlers. CoRR abs/2304.02145 (2023) - 2022
- [e2]Jeremy Gibbons, Max S. New:
Proceedings Ninth Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2022, Munich, Germany, 2nd April 2022. EPTCS 360, 2022 [contents] - [i5]Max S. New, Daniel R. Licata:
A Formal Logic for Formal Category Theory. CoRR abs/2210.08663 (2022) - 2021
- [j8]Max S. New
Gradual type theory. J. Funct. Program. 31: e21 (2021) - 2020
- [j7]Max S. New, Daniel R. Licata:
Call-by-name Gradual Type Theory. Log. Methods Comput. Sci. 16(1) (2020) - [j6]Max S. New, Dustin Jamner
Graduality and parametricity: together again for the first time. Proc. ACM Program. Lang. 4(POPL): 46:1-46:32 (2020) - [e1]Max S. New, Sam Lindley:
Proceedings Eighth Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2020, Dublin, Ireland, 25th April 2020. EPTCS 317, 2020 [contents]
2010 – 2019
- 2019
- [j5]Ben Greenman
How to evaluate the performance of gradual type systems. J. Funct. Program. 29: e4 (2019) - [j4]Max S. New, Daniel R. Licata, Amal Ahmed
Gradual type theory. Proc. ACM Program. Lang. 3(POPL): 15:1-15:31 (2019) - 2018
- [j3]Max S. New, Amal Ahmed
Graduality from embedding-projection pairs. Proc. ACM Program. Lang. 2(ICFP): 73:1-73:30 (2018) - [j2]Jay A. McCarthy, Burke Fetscher, Max S. New, Daniel Feltey, Robert Bruce Findler:
A Coq library for internal verification of running-times. Sci. Comput. Program. 164: 49-65 (2018) - [c6]Gabriel Scherer, Max S. New, Nick Rioux, Amal Ahmed:
Fab ous Interoperability for ML and a Linear Language. FoSSaCS 2018: 146-162 - [c5]Max S. New, Daniel R. Licata:
Call-by-Name Gradual Type Theory. FSCD 2018: 24:1-24:17 - [i4]Max S. New, Daniel R. Licata:
Call-by-name Gradual Type Theory. CoRR abs/1802.00061 (2018) - [i3]Max S. New, Amal Ahmed:
Graduality from Embedding-projection Pairs (Extended Version). CoRR abs/1807.02786 (2018) - [i2]Max S. New, Daniel R. Licata, Amal Ahmed:
Gradual Type Theory (Extended Version). CoRR abs/1811.02440 (2018) - 2017
- [j1]Max S. New, Burke Fetscher, Robert Bruce Findler, Jay A. McCarthy:
Fair enumeration combinators. J. Funct. Program. 27: e19 (2017) - [i1]Gabriel Scherer, Max S. New, Nicholas Rioux, Amal Ahmed:
FabULous Interoperability for ML and a Linear Language. CoRR abs/1707.04984 (2017) - 2016
- [c4]Jay A. McCarthy, Burke Fetscher, Max S. New, Daniel Feltey, Robert Bruce Findler:
A Coq Library for Internal Verification of Running-Times. FLOPS 2016: 144-162 - [c3]Max S. New, William J. Bowman
Fully abstract compilation via universal embedding. ICFP 2016: 103-116 - [c2]Christos Dimoulas, Max S. New, Robert Bruce Findler, Matthias Felleisen:
Oh Lord, please don't let contracts be misunderstood (functional pearl). ICFP 2016: 117-131 - [c1]Asumu Takikawa, Daniel Feltey, Ben Greenman
Is sound gradual typing dead? POPL 2016: 456-468
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-08-05 21:12 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: