research
∙
09/20/2023
A Verified Cost Analysis of Joinable Red-Black Trees
Ordered sequences of data, specified with a join operation to combine se...
share
research
∙
09/01/2023
Logical Relations for Session-Typed Concurrency
Program equivalence is the fulcrum for reasoning about and proving prope...
research
∙
07/12/2023
Decalf: A Directed, Effectful Cost-Aware Logical Framework
We present decalf, a directed, effectful cost-aware logical framework fo...
research
∙
03/28/2023
Amortized Analysis via Coinduction
Amortized analysis is a program cost analysis technique for data structu...
research
∙
09/26/2022
A metalanguage for cost-aware denotational semantics
We present two metalanguages for developing synthetic cost-aware denotat...
research
∙
04/20/2022
Sheaf semantics of termination-insensitive noninterference
We propose a new sheaf semantics for secure information flow over a spac...
research
∙
07/09/2021
A cost-aware logical framework
We present calf, a cost-aware logical framework for studying quantitativ...
research
∙
06/02/2021
An Equational Logical Framework for Type Theories
A wide range of intuitionistic type theories may be presented as equatio...
research
∙
11/07/2020
Cost-Aware Type Theory
Although computational complexity is a fundamental aspect of program beh...
research
∙
10/16/2020
Logical Relations as Types: Proof-Relevant Parametricity for Program Modules
The theory of program modules is of interest to language designers not o...
research
∙
05/22/2020
Internal Parametricity for Cubical Type Theory
We define a computational type theory combining the contentful equality ...
research
∙
01/02/2019
Parametric Cubical Type Theory
We exhibit a computational type theory which combines the higher-dimensi...
research
∙
07/10/2018
Competitive Parallelism: Getting Your Priorities Right
Multi-threaded programs have traditionally fallen into one of two domain...
research
∙
07/05/2018
The RedPRL Proof Assistant (Invited Paper)
RedPRL is an experimental proof assistant based on Cartesian cubical com...
research
∙
04/24/2018
Guarded Computational Type Theory
Nakano's later modality can be used to specify and define recursive func...
research
∙
02/12/2018
Inferring the time-varying functional connectivity of large-scale computer networks from emitted events
We consider the problem of inferring the functional connectivity of a la...
research
∙
02/08/2018
A Separation Logic for Concurrent Randomized Programs
We present a concurrent separation logic with support for probabilistic ...
research
∙
01/04/2018
Computational Higher Type Theory IV: Inductive Types
This is the fourth in a series of papers extending Martin-Löf's meaning ...
research
∙
12/05/2017
