An expressive, scalable type theory for certified code (2002)
Cached
Download Links
- [www.cs.caltech.edu]
- [www-2.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.caltech.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In ACM International Conference on Functional Programming |
| Citations: | 31 - 4 self |
BibTeX
@INPROCEEDINGS{Crary02anexpressive,,
author = {Karl Crary and Joseph C. Vanderwaart},
title = {An expressive, scalable type theory for certified code},
booktitle = {In ACM International Conference on Functional Programming},
year = {2002},
pages = {191--205},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proofs allows the type system to guarantee properties that would otherwise be incompatible with decidable type checking. LTT also provides linear facilities for tracking ephemeral properties that hold only for certain program states. Our type theory allows for re-use of typechecking software by casting a variety of type systems within a single language. We provide additional re-use with a framework for modular development of operational semantics. This framework allows independent type systems and their operational semantics to be joined together, automatically inheriting the type safety properties of those individual systems.
