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

Active Bibliography

TPS: A Theorem Proving System for Classical Type Theory – P. B. (peter, Bruce Andrews, Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Hongwei Xi, Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi - 1995
17 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
716 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
433 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
Automation of Higher-Order Logic – Christoph Benzmüller, Dale Miller
1586 Some philosophical problems from the standpoint of artificial intelligence – John McCarthy, Patrick J. Hayes - 1969
503 Model Checking Programs – Willem Visser, Klaus Havelund, GUILLAUME BRAT, SEUNGJOON PARK, FLAVIO LERDA - 2003
1096 Learning Stochastic Logic Programs – Stephen Muggleton - 2000