activity
20102021
most citedIrrelevance, Heterogeneous Equality, and Call-by-value Dependent Type Systems

17 citations · 36 across the 16 of their papers we have counts for

collaborators
Showing 2018Show all

7 papers · 1 filter

cs.LO2018★ 2 cited

Syntax and Typing for Cedille Core

Aaron Stump

This document specifies a core version of the type theory implemented in the Cedille tool. Cedille is a language for dependently typed programming and computer-checked proof. Cedil…

cs.LO2018★ 1 cited

Course-of-Value Induction in Cedille

Denis Firsov, Larry Diehl, Christopher Jenkins +1

In the categorical setting, histomorphisms model a course-of-value recursion scheme that allows functions to be defined using arbitrary previously computed values. In this paper, w…

cs.PL2018★ 4 cited

Syntax and Semantics of Cedille

Aaron Stump, Christopher Jenkins

This document presents the syntax, classification rules, realizability semantics, and soundness theorem for Cedille, an extrinsic (i.e., Curry-style) type theory extending the Calc…

cs.PL2018

Spine-local Type Inference

Christopher Jenkins, Aaron Stump

We present spine-local type inference, a partial type inference system for inferring omitted type annotations for System F terms based on local type inference. Local type inference…

cs.PL2018

Efficient Mendler-Style Lambda-Encodings in Cedille

Denis Firsov, Richard Blair, Aaron Stump

It is common to model inductive datatypes as least fixed points of functors. We show that within the Cedille type theory we can relax functoriality constraints and generically deri…

cs.PL2018

Generic Zero-Cost Reuse for Dependent Types

Larry Diehl, Denis Firsov, Aaron Stump

Dependently typed languages are well known for having a problem with code reuse. Traditional non-indexed algebraic datatypes (e.g. lists) appear alongside a plethora of indexed var…