research
∙
03/25/2022
Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version
LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on...
share
research
∙
12/15/2021
Simulating Large Eliminations in Cedille
Large eliminations provide an expressive mechanism for arity- and type-g...
research
∙
01/24/2021
Relational Type Theory (All Proofs)
This paper introduces Relational Type Theory (RelTT), a new approach to ...
research
∙
05/01/2020
Efficient lambda encodings for Mendler-style coinductive types in Cedille
In the calculus of dependent lambda eliminations (CDLE), it is possible ...
research
∙
01/09/2020
Monotone recursive types and recursive data representations in Cedille
Guided by Tarksi's fixpoint theorem in order theory, we show how to deri...
research
∙
03/19/2019
Elaborating Inductive Datatypes and Course-of-Values Pattern Matching to Cedille
In CDLE, a pure Curry-style type theory, it is possible to generically d...
research
∙
11/29/2018
Course-of-Value Induction in Cedille
In the categorical setting, histomorphisms model a course-of-value recur...
research
∙
05/25/2018