Programming with proofs and explicit contexts
Cached
Download Links
- [www.cs.mcgill.ca]
- [www.cs.mcgill.ca]
- [complogic.cs.mcgill.ca]
- [www.cs.cmu.edu]
- [web.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Symposium on Principles and Practice of Declarative Programming, 2008. François Pottier and Nadji |
| Citations: | 13 - 7 self |
BibTeX
@INPROCEEDINGS{Pientka_programmingwith,
author = {Brigitte Pientka},
title = {Programming with proofs and explicit contexts},
booktitle = {In Symposium on Principles and Practice of Declarative Programming, 2008. François Pottier and Nadji},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper explores a new point in the design space of functional programming: functional programming with dependently-typed higher-order data structures described in the logical framework LF. This allows us to program with proofs as higher-order data. We present a decidable bidirectional type system that distinguishes between dependentlytyped data and computations. To support reasoning about open data, our foundation makes contexts explicit. This provides us with a concise characterization of open data, which is crucial to elegantly describe proofs. In addition, we present an operational semantics for this language based on higher-order pattern matching for dependently typed objects. Based on this development, we prove progress and preservation.
