Programming with Dependent Types and Higher-Order Encodings
by
Adam Poswolsky
,
Carsten Schürmann
,
Adam Poswolsky
,
Carsten Schürmann
BibTeX
@MISC{Poswolsky_programmingwith,
author = {Adam Poswolsky and Carsten Schürmann and Adam Poswolsky and Carsten Schürmann},
title = {Programming with Dependent Types and Higher-Order Encodings},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this work, we propose a temporal logic with a past-time operator, show its soundness, and establish a Curry-Howard correspondence to a λ-calculus. Furthermore, we illustrate how it serves as a logical foundation for programming with dependently typed data, supports programming with higher-order abstract syntax and hypothetical judgments. Sample programs that we discuss in this paper include bracket abstraction. Important Note: There is an updated/simplified presentation of this system available as Yale Technical Report TR-1364
