research
∙
04/04/2023
Gradual Typing for Effect Handlers
We present a gradually typed language, GrEff, with effects and handlers ...
share
research
∙
10/16/2022
A Formal Logic for Formal Category Theory
We present a domain-specific type theory for constructions and proofs in...
research
∙
06/26/2020
Denotational recurrence extraction for amortized analysis
A typical way of analyzing the time complexity of functional programs is...
research
∙
02/17/2020
Denotational semantics as a foundation for cost recurrence extraction for functional languages
A standard method for analyzing the asymptotic complexity of a program i...
research
∙
11/11/2019
Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version)
The main way of analyzing the complexity of a program is that of extract...
research
∙
11/06/2018
Gradual Type Theory (Extended Version)
Gradually typed languages are designed to support both dynamically typed...
research
∙
01/31/2018
Call-by-name Gradual Type Theory
We present gradual type theory, a logic and type theory for call-by-name...
research
∙
01/23/2018
