A Module Calculus for Pure Type Systems (1997)
Cached
Download Links
- [lara.inist.fr]
- [www.lri.fr]
- [www.lri.fr]
- [ftp.ens-lyon.fr]
- [www-verimag.imag.fr]
- DBLP
Other Repositories/Bibliography
by
Judicaël Courant
| Citations: | 23 - 3 self |
BibTeX
@MISC{Courant97amodule,
author = {Judicaël Courant},
title = {A Module Calculus for Pure Type Systems},
year = {1997}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Several proof-assistants rely on the very formal basis of Pure Type Systems (PTS) as their foundations. We are concerned with the issues involved in the development of large proofs in these provers such as namespace management, development of reusable proof libraries and separate verification. Although actual implementations offer many features to address them, few theoretical foundations have been laid for them up to now.
