论文信息 - A Look at TPS

A Look at TPS

Certain aspects of the theorem proving system TPS are described. Type theory with λ-abstraction has been chosen as the logical language of TPS so that statements from many fields of mathematics and other disciplines can be expressed in terms accessible to the system.

Peter B. Andrews | Eve Longini Cohen | Dale A. Miller

[1] Peter B. Andrews. Transforming Matings into Natural Deduction Proofs , 1980, CADE.

[2] Brian K Reid,et al. SCRIBE Introductory User's Manual. , 1978 .

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

[4] Tomasz Pietrzykowski,et al. Mechanizing omega-Order Type Theory Through Unification , 1976, Theor. Comput. Sci..

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

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