(Enter summary)
Abstract: This is a description of TPS, a theorem proving system for classical type theory (Church's typed
l-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... (Update)
Cited by: More
Ants { An open approach at combining - Interactive And Automated (2001)
(Correct)
Integrating Tps - Christoph Benzm Uller (1999)
(Correct)
Non-trivial Symbolic Computations in Proof - Planning Volker Sorge (2000)
(Correct)
Similar documents (at the sentence level):
65.9%: TPS: A Theorem-Proving System for Classical Type Theory - Andrews, Bishop, Issar.. (1996)
(Correct)
Active bibliography (related documents): More All
0.1: TPS: An Interactive and Automatic Tool for Proving .. - Andrews, Bishop..
(Correct)
0.1: Higher-Order Logic Programming - Nadathur, Miller (1986)
(Correct)
0.0: Higher-Order Order-Sorted Resolution - Kohlhase (1994)
(Correct)
Similar documents based on text: More All
1.7: Cv - Xi (1999)
(Correct)
0.6: On Sets, Types, Fixed Points, and Checkerboards - Andrews, Bishop
(Correct)
0.4: ETPS: A System to Help Students Write Formal Proofs - Andrews, Bishop, Brown.. (2003)
(Correct)
Related documents from co-citation: More All
23: An Introduction to Mathematical Logic and Type Theory: To Truth through Proof (context) - Andrews - 1986
15: A formulation of the simple theory of types (context) - Church - 1940
13: Integrating Computer Algebra Into Proof Planning
- Kerber, Kohlhase et al. - 1998
BibTeX entry: (Update)
Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, and Hongwei Xi. TPS: A theorem proving system for classical type theory. Technical Report 94--166, Department of Mathematics, Carnegie Mellon University, 1994. http://citeseer.ist.psu.edu/article/andrews94tps.html More
@misc{ andrews94tps,
author = "P. Andrews and M. Bishop and S. Issar and D. Nesmith and F. Pfenning and
H. Xi",
title = "TPS: A theorem proving system for classical type theory",
text = "Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning,
and Hongwei Xi. TPS: A theorem proving system for classical type theory.
Technical Report 94--166, Department of Mathematics, Carnegie Mellon University,
1994.",
year = "1994",
url = "citeseer.ist.psu.edu/article/andrews94tps.html" }
Citations (may not include all citations):
151
An Introduction to Mathematical Logic and Type Theory: To Tr.. (context) - Andrews - 1986
73
Theorem Proving via General Matings (context) - Andrews - 1981
42
Resolution in Type Theory (context) - Andrews - 1971
30
Transforming Matings into Natural Deduction Proofs (context) - Andrews - 1980
27
Automating HigherOrder Logic (context) - Andrews, Miller et al. - 1984
20
On Connections and Higher-Order Logic (context) - Andrews
1
IEEE Transactions on Computers C (context) - Andrews, Matings - 1976
1
Zeitschrift fur Mathematische Logic und Grundlagen der Mathe.. (context) - Andrews, Elementary et al. - 1974
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://gtps.math.cmu.edu/andrews.html): More
On Sets, Types, Fixed Points, and Checkerboards - Andrews, Bishop
(Correct)
System Description: TPS: A Theorem Proving System for Type.. - Andrews, Bishop, Brown (2000)
(Correct)
Classical Type Theory - Andrews (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC