tps: A theorem proving system for classical type theory

tps: A theorem proving system for classical type theory (1996)

by Peter B. Andrews , Matthew Bishop , Sunil Issar , Dan Nesmith , Frank Pfenning , Hongwei Xi

Venue:	Journal of Automated Reasoning
Citations:	64 - 5 self

Datum	Value	Source
TITLE	TPS: A Theorem Proving System for Classical Type Theory	SVM HeaderParse 0.2
AUTHOR NAME	Peter B. Andrews	SVM HeaderParse 0.2
AUTHOR NAME	Matthew Bishop	SVM HeaderParse 0.2
AUTHOR NAME	Sunil Issar	SVM HeaderParse 0.2
AUTHOR NAME	Dan Nesmith	SVM HeaderParse 0.2
AUTHOR NAME	Frank Pfenning	SVM HeaderParse 0.2
AUTHOR NAME	Hongwei Xi	SVM HeaderParse 0.2
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	SVM HeaderParse 0.2
CITATIONS	58 found	ParsCit 1.0