论文信息 - System Description: TPS: A Theorem Proving System for Type Theory

System Description: TPS: A Theorem Proving System for Type Theory

This is a brief update on the Tps automated theorem proving system for classical type theory, which was described in [3]. Manuals and information about obtaining Tps can be found at http://gtps.math.cmu.edu/tps.html.

Peter B. Andrews | Chad E. Brown | Matthew Bishop

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

[2] Sunil Issar. Path-Focused Duplication: A Search Procedure for General Matings , 1990, AAAI.

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

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

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

[6] Sunil Issar. Operational issues in automated theorem proving using matings , 1991 .

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

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

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

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

[11] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.