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:69 - 6 self

Active Bibliography

16 TPS: A Theorem-Proving System for Classical Type Theory – Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi - 1996
19 Higher Order Logic – Daniel Leivant - 1994
4 Herbrand award acceptance speech – Peter B. Andrews - 2003
27 The TPS theorem proving system – Peter B. Andrews, Sunil Issar, Dan Nesmith, Frank Pfenning - 1988
A Challenge for Mechanized Deduction – Christoph Benzmüller, Manfred Kerber
2 A Lost Proof – Christoph Benzmüller, Manfred Kerber - 2001
124 Unification under a mixed prefix – Dale Miller - 1992
Contents – The Phragmén-lindelöf Theorem - 2006
1 Higher-Order Rigid E-Unification – Jean Goubault
8 A Calculus and a System Architecture for Extensional Higher-Order Resolution – Christoph Benzmüller - 1997
7 Designing a Theorem Prover – Lawrence C Paulson - 1990
3 Cut-simulation in impredicate logics – Christoph E. Benzmüller, Chad E. Brown, Michael Kohlhase - 2006
3 CUT-SIMULATION AND IMPREDICATIVITY – Christoph Benzmüller , Chad E. Brown , Michael Kohlhase - 2009
9 Multimodal and Intuitionistic Logics in Simple Type Theory – C. Benzmüller, L. C. Paulson
October 1990 A short article for the – Encyclopedia Of Artificial
A short article for the Encyclopedia of Artificial Intelligence: Second Edition “Logic, Higher-order” – unknown authors - 1991
422 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
2 Proof-search in type-theoretic languages: an introduction – Didier Galmiche, David J. Pym - 2000
1 TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory – Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi, Contact Peter, B. Andrews - 1994