TPS: A hybrid automatic-interactive system for developing proofs

Abstract The theorem proving system Tps provides support for constructing proofs using a mix of automation and user interaction, and for manipulating and inspecting proofs. Its library facilities allow the user to store and organize work. Mathematical theorems can be expressed very naturally in Tps using higher-order logic. A number of proof representations are available in Tps , so proofs can be inspected from various perspectives.

[1]  David Aspinall,et al.  Formalising Java's Data Race Free Guarantee , 2007, TPHOLs.

[2]  MA John Harrison PhD.  Theorem Proving with the Real Numbers , 1998, Distinguished Dissertations.

[3]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[4]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[5]  Peter B. Andrews,et al.  System Description: TPS: A Theorem Proving System for Type Theory , 2000, CADE.

[6]  M. Gordon.  HOL: A Proof Generating System for Higher-Order Logic , 1988 .

[7]  Peter B. Andrews,et al.  Set comprehension in church's type theory , 2004 .

[8]  Peter B. Andrews.  Theorem Proving via General Matings , 1981, JACM.

[9]  Peter B. Andrews,et al.  Mating search without path enumeration , 1999 .

[10]  W. W. Bledsoe,et al.  A Man-Machine Theorem-Proving System , 1973, IJCAI.

[11]  Frank Pfenning,et al.  Presenting Intuitive Deductions via Symmetric Simplification , 1990, CADE.

[12]  Lawrence C. Paulson,et al.  The foundation of a generic theorem prover , 1989, Journal of Automated Reasoning.

[13]  Matthew Bishop,et al.  A Breadth-First Strategy for Mating Search , 1999, CADE.

[14]  Dave Barker-Plummer.  Gazing: An approach to the problem of definition and lemma use , 2006, Journal of Automated Reasoning.

[15]  William M. Farmer,et al.  IMPS: An Interactive Mathematical Proof System , 1990, CADE.

[16]  Christoph Benzmüller,et al.  Equality and extensionality in automated higher order theorem proving , 1999 .

[17]  Natarajan Shankar,et al.  PVS: Combining Specification, Proof Checking, and Model Checking , 1996, FMCAD.

[18]  Peter B. Andrews.  Resolution in type theory , 1971, Journal of Symbolic Logic.

[19]  Frank Pfenning,et al.  TPS: A theorem-proving system for classical type theory , 1996, Journal of Automated Reasoning.

[20]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[21]  Peter B. Andrews,et al.  Selectively Instantiating Definitions , 1998, CADE.

[22]  David A. Plaisted,et al.  Eliminating duplication with the hyper-linking strategy , 1992, Journal of Automated Reasoning.

[23]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

[24]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[25]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[26]  Ian Green,et al.  System Description: Proof Planning in Higher-Order Logic with Lambda-Clam , 1998, CADE.

[27]  Chad E. Brown.  Solving for Set Variables in Higher-Order Theorem Proving , 2002, CADE.

[28]  Karsten Konrad,et al.  Model Generation for Natural Language Interpretation and Analysis , 2004, Lecture Notes in Computer Science.

[29]  Dale Miller,et al.  Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs , 1984, CADE.

[30]  Neil V. Murray,et al.  Dissolution: making paths vanish , 1993, JACM.

[31]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[32]  Karsten Konrad.  HOT: A Concurrent Automated Theorem Prover Based on Higher-Order Tableaux , 1998, TPHOLs.

[33]  Peter B. Andrews.  On connections and higher-order logic , 2004, Journal of Automated Reasoning.

[34]  Dale A. Miller,et al.  A compact representation of proofs , 1987, Stud Logica.

[35]  Natarajan Shankar,et al.  Using Decision Procedures with a Higher-Order Logic , 2001, TPHOLs.

[36]  Alan Smaill,et al.  Logic Program Synthesis in a Higher-Order Setting , 2000, Computational Logic.

[37]  Frank Pfenning,et al.  ETPS: A System to Help Students Write Formal Proofs , 2004, Journal of Automated Reasoning.

[38]  Alan Robinson,et al.  Handbook of automated reasoning , 2001 .

[39]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[40]  Frank Pfenning,et al.  System Description: Twelf - A Meta-Logical Framework for Deductive Systems , 1999, CADE.

[41]  Christoph Benzmüller,et al.  Higher-order semantics and extensionality , 2004, Journal of Symbolic Logic.

[42]  W. W. Bledsoe,et al.  SET-VAR , 2004, Journal of Automated Reasoning.

[43]  Gérard P. Huet,et al.  A Unification Algorithm for Typed lambda-Calculus , 1975, Theor. Comput. Sci..

[44]  Peter B. Andrews.  Classical Type Theory , 2001, Handbook of Automated Reasoning.

[45]  Christoph Benzmüller,et al.  System Description: LEO - A Higher-Order Theorem Prover , 1998, CADE.

[46]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.