tps: A theorem proving system for classical type theory (1996)
| Venue: | Journal of Automated Reasoning |
| Citations: | 64 - 5 self |
BibTeX
@ARTICLE{Andrews96tps:a,
author = {Peter B. Andrews and Matthew Bishop and Sunil Issar and Dan Nesmith and Frank Pfenning and Hongwei Xi},
title = {tps: A theorem proving system for classical type theory},
journal = {Journal of Automated Reasoning},
year = {1996},
volume = {16},
pages = {321--353}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This is a description of TPS, a theorem proving system for classical type theory (Church’s typed λ-calculus). TPS has been designed to be a general research tool for manipulating wffs of first- and higher-order logic, and searching for proofs of such wffs interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. Examples of theorems which TPS can prove completely automatically are given to illustrate certain aspects of TPS’s behavior and problems of theorem proving in higher-order logic. 7
