Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory
 

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
412­268­2554
Abstract
This is a demonstration of TPS, a theorem proving system for classical type theory (Church's typed l­calculus).
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

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

 

Collections: Mathematics