20 citations · 43 across the 5 of their papers we have counts for
7 papers
Synthetic Spectra via a Monadic and Comonadic Modality
Mitchell Riley, Eric Finster, Daniel R. Licata
We extend Homotopy Type Theory with a novel modality that is simultaneously a monad and a comonad. Because this modality induces a non-trivial endomap on every type, it requires a…
Denotational recurrence extraction for amortized analysis
Joseph W. Cutler, Daniel R. Licata, Norman Danner
A typical way of analyzing the time complexity of functional programs is to extract a recurrence expressing the running time of the program in terms of the size of its input, and t…
Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version)
G. A. Kavvos, Edward Morehouse, Daniel R. Licata +1
The main way of analyzing the complexity of a program is that of extracting and solving a recurrence that expresses its running time in terms of the size of its input. We develop a…
Gradual Type Theory (Extended Version)
Max S. New, Daniel R. Licata, Amal Ahmed
Gradually typed languages are designed to support both dynamically typed and statically typed programming styles while preserving the benefits of each. While existing gradual type…
A mechanization of the Blakers-Massey connectivity theorem in Homotopy Type Theory
Kuen-Bang Hou, Eric Finster, Dan Licata +1
This paper continues investigations in "synthetic homotopy theory": the use of homotopy type theory to give machine-checked proofs of constructions from homotopy theory We present…
Denotational cost semantics for functional languages with inductive types
Norman Danner, Daniel R. Licata, Ramyaa Ramyaa
A central method for analyzing the asymptotic complexity of a functional program is to extract and then solve a recurrence that expresses evaluation cost in terms of input size. Th…