
Relational Type Theory (All Proofs)
This paper introduces Relational Type Theory (RelTT), a new approach to ...
read it

Efficient lambda encodings for Mendlerstyle coinductive types in Cedille
In the calculus of dependent lambda eliminations (CDLE), it is possible ...
read it

Monotone recursive types and recursive data representations in Cedille
Guided by Tarksi's fixpoint theorem in order theory, we show how to deri...
read it

A Weakly Initial Algebra for HigherOrder Abstract Syntax in Cedille
Cedille is a relatively recent tool based on a Currystyle pure type the...
read it

Elaborating Inductive Datatypes and CourseofValues Pattern Matching to Cedille
In CDLE, a pure Currystyle type theory, it is possible to generically d...
read it

CourseofValue Induction in Cedille
In the categorical setting, histomorphisms model a courseofvalue recur...
read it

Syntax and Typing for Cedille Core
This document specifies a core version of the type theory implemented in...
read it

Syntax and Semantics of Cedille
This document presents the syntax, classification rules, realizability s...
read it

Spinelocal Type Inference
We present spinelocal type inference, a partial type inference system f...
read it

Generic ZeroCost Reuse for Dependent Types
Dependently typed languages are well known for having a problem with cod...
read it

Efficient MendlerStyle LambdaEncodings in Cedille
It is common to model inductive datatypes as least fixed points of funct...
read it

ZeroCost Coercions for Program and Proof Reuse
We introduce the notion of identity coercions between nonindexed and in...
read it
Aaron Stump
is this you? claim profile