default search action
Daniel R. Licata
Person information
- affiliation: Wesleyan University, Middletown, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j12]Dan Licata
, Peter LeFanu Lumsdaine:
Special issue on homotopy type theory 2019 vol. 2. Math. Struct. Comput. Sci. 33(8): 660 (2023) - [j11]Max S. New
Gradual Typing for Effect Handlers. Proc. ACM Program. Lang. 7(OOPSLA2): 1758-1786 (2023) - [c24]Max S. New
A Formal Logic for Formal Category Theory. FoSSaCS 2023: 113-134 - [i11]Max S. New, Eric Giovannini, Daniel R. Licata:
Gradual Typing for Effect Handlers. CoRR abs/2304.02145 (2023) - 2022
- [j10]Norman Danner
Denotational semantics as a foundation for cost recurrence extraction for functional languages. J. Funct. Program. 32: e8 (2022) - [i10]Max S. New, Daniel R. Licata:
A Formal Logic for Formal Category Theory. CoRR abs/2210.08663 (2022) - 2021
- [j9]Max S. New
Gradual type theory. J. Funct. Program. 31: e21 (2021) - [j8]Carlo Angiuli
Syntax and models of Cartesian cubical type theory. Math. Struct. Comput. Sci. 31(4): 424-468 (2021) - [j7]Dan Licata
Special issue on homotopy type theory 2019. Math. Struct. Comput. Sci. 31(10): 1145-1146 (2021) - 2020
- [j6]Max S. New, Daniel R. Licata:
Call-by-name Gradual Type Theory. Log. Methods Comput. Sci. 16(1) (2020) - [j5]Joseph W. Cutler
Denotational recurrence extraction for amortized analysis. Proc. ACM Program. Lang. 4(ICFP): 97:1-97:29 (2020) - [j4]G. A. Kavvos
Recurrence extraction for functional programs through call-by-push-value. Proc. ACM Program. Lang. 4(POPL): 15:1-15:31 (2020) - [c23]Matthew Z. Weaver, Daniel R. Licata:
A Constructive Model of Directed Univalence in Bicubical Sets. LICS 2020: 915-928 - [i9]Norman Danner, Daniel R. Licata:
Denotational semantics as a foundation for cost recurrence extraction for functional languages. CoRR abs/2002.07262 (2020) - [i8]Joseph W. Cutler, Daniel R. Licata, Norman Danner:
Denotational recurrence extraction for amortized analysis. CoRR abs/2006.15036 (2020)
2010 – 2019
- 2019
- [j3]Max S. New, Daniel R. Licata, Amal Ahmed
Gradual type theory. Proc. ACM Program. Lang. 3(POPL): 15:1-15:31 (2019) - [i7]G. A. Kavvos
Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version). CoRR abs/1911.04588 (2019) - 2018
- [c22]Daniel R. Licata, Ian Orton, Andrew M. Pitts, Bas Spitters
Internal Universes in Models of Homotopy Type Theory. FSCD 2018: 22:1-22:17 - [c21]Max S. New, Daniel R. Licata:
Call-by-Name Gradual Type Theory. FSCD 2018: 24:1-24:17 - [i6]Daniel R. Licata, Ian Orton, Andrew M. Pitts, Bas Spitters
Internal Universes in Models of Homotopy Type Theory. CoRR abs/1801.07664 (2018) - [i5]Max S. New, Daniel R. Licata:
Call-by-name Gradual Type Theory. CoRR abs/1802.00061 (2018) - [i4]Max S. New, Daniel R. Licata, Amal Ahmed:
Gradual Type Theory (Extended Version). CoRR abs/1811.02440 (2018) - 2017
- [c20]Daniel R. Licata
A Fibrational Framework for Substructural and Modal Logics. FSCD 2017: 25:1-25:22 - 2016
- [j2]Carlo Angiuli
Homotopical patch theory. J. Funct. Program. 26: e18 (2016) - [c19]Dan Licata:
A functional programmer's guide to homotopy type theory. ICFP 2016: 3 - [c18]Daniel R. Licata
Adjoint Logic with a 2-Category of Modes. LFCS 2016: 219-235 - [c17]Kuen-Bang Hou (Favonia)
A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory. LICS 2016: 565-574 - [e1]Gilles Dowek, Daniel R. Licata, Sandra Alves:
Proceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP 2016, Porto, Portugal, June 23, 2016. ACM 2016, ISBN 978-1-4503-4777-8 [contents] - [i3]Kuen-Bang Hou (Favonia), Eric Finster, Daniel R. Licata, Peter LeFanu Lumsdaine:
A mechanization of the Blakers-Massey connectivity theorem in Homotopy Type Theory. CoRR abs/1605.03227 (2016) - 2015
- [c16]Norman Danner, Daniel R. Licata
Denotational cost semantics for functional languages with inductive types. ICFP 2015: 140-151 - [c15]Daniel R. Licata
A Cubical Approach to Synthetic Homotopy Theory. LICS 2015: 92-103 - [i2]Norman Danner, Daniel R. Licata, Ramyaa Ramyaa:
Denotational cost semantics for functional languages with inductive types. CoRR abs/1506.01949 (2015) - 2014
- [c14]Daniel R. Licata
Eilenberg-MacLane spaces in homotopy type theory. CSL-LICS 2014: 66:1-66:9 - [c13]Carlo Angiuli
Homotopical patch theory. ICFP 2014: 243-256 - 2013
- [c12]Daniel R. Licata
π n (S n ) in Homotopy Type Theory. CPP 2013: 1-16 - [c11]Daniel R. Licata
Calculating the Fundamental Group of the Circle in Homotopy Type Theory. LICS 2013: 223-232 - [i1]Daniel R. Licata, Michael Shulman:
Calculating the Fundamental Group of the Circle in Homotopy Type Theory. CoRR abs/1301.3443 (2013) - 2012
- [c10]Daniel R. Licata
Canonicity for 2-dimensional type theory. POPL 2012: 337-348 - 2011
- [c9]Daniel R. Licata
2-Dimensional Directed Type Theory. MFPS 2011: 263-289 - 2010
- [c8]Jamie Morgenstern, Daniel R. Licata
Security-typed programming within dependently typed programming. ICFP 2010: 169-180 - [c7]Daniel R. Licata
A Monadic Formalization of ML5. LFMTP 2010: 69-83
2000 – 2009
- 2009
- [c6]Daniel R. Licata
A universe of binding and computation. ICFP 2009: 123-134 - [c5]Daniel R. Licata, Robert Harper:
Positively dependent types. PLPV 2009: 3-14 - [c4]Robert Harper, Daniel R. Licata
A Pronominal Approach to Binding and Computation. TLCA 2009: 3-4 - 2008
- [c3]Daniel R. Licata
Focusing on Binding and Computation. LICS 2008: 241-252 - 2007
- [j1]Robert Harper, Daniel R. Licata
Mechanizing metatheory in a logical framework. J. Funct. Program. 17(4-5): 613-673 (2007) - 2004
- [c2]Daniel R. Licata, Shriram Krishnamurthi:
Verifying Interactive Web Programs. ASE 2004: 164-173 - 2003
- [c1]Daniel R. Licata, Christopher D. Harris, Shriram Krishnamurthi
The Feature Signatures of Evolving Programs. ASE 2003: 281-285
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-04-24 23:20 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: