Proof Terms for Simply Typed Higher Order Logic (2000)
Cached
Download Links
- [www4.in.tum.de]
- [www4.in.tum.de]
- [www4.informatik.tu-muenchen.de]
- [wwwbroy.informatik.tu-muenchen.de]
- [www4.in.tum.de]
- DBLP
Other Repositories/Bibliography
by
Stefan Berghofer
,
Tobias Nipkow
| Venue: | IN THEOREM PROVING IN HIGHER ORDER LOGICS, 13TH INTERNATIONAL CONFERENCE, VOLUME 1869 OF LNCS |
| Citations: | 32 - 9 self |
BibTeX
@INPROCEEDINGS{Berghofer00proofterms,
author = {Stefan Berghofer and Tobias Nipkow},
title = {Proof Terms for Simply Typed Higher Order Logic},
booktitle = {IN THEOREM PROVING IN HIGHER ORDER LOGICS, 13TH INTERNATIONAL CONFERENCE, VOLUME 1869 OF LNCS},
year = {2000},
pages = {38--52},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and reconstruction of proof terms are described and have been implemented in the theorem prover Isabelle. Experimental results confirm the effectiveness of the compression scheme.
