 
Summary: TPS: An Interactive and Automatic Tool
for Proving Theorems of Type Theory
1 1 1
Peter B. Andrews , Matthew Bishop , Sunil Issar ,
2 1 1
Dan Nesmith , Frank Pfenning , Hongwei Xi
Contact: Peter B. Andrews
Mathematics Department
Carnegie Mellon University
Pittsburgh, PA 15213, U.S.A.
Andrews@CS.CMU.EDU
4122682554
Abstract
This is a demonstration of TPS, a theorem proving system for classical type theory (Church's typed lcalculus).
TPS can be used 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.
CATEGORY: Demonstration
1. Introduction
This presentation is a demonstration of TPS, a theorem proving system for classical type theory (Church's typed
3
