research
∙
10/11/2021
Free Commutative Monoids in Homotopy Type Theory
We develop a constructive theory of finite multisets, defining them as f...
share
research
∙
10/11/2021
Symmetries in Reversible Programming: From Symmetric Rig Groupoids to Reversible Programming Languages
The Î family of reversible programming languages for boolean circuits is...
research
∙
02/17/2020
Fractional Types: Expressive and Safe Space Management for Ancilla Bits
In reversible computing, the management of space is subject to two broad...
research
∙
07/16/2019
Recovering Purity with Comonads and Capabilities
In this paper, we take a pervasively effectful (in the style of ML) type...
research
∙
11/09/2017
Refinement Reflection: Complete Verification with SMT
We introduce Refinement Reflection, a new framework for building SMT-bas...
research
∙
08/09/2017
From Reversible Programs to Univalent Universes and Back
We establish a close connection between a reversible programming languag...
research
∙
08/07/2017
Deriving Law-Abiding Instances
Liquid Haskell's refinement-reflection feature augments the Haskell lang...
research
∙
08/07/2017
