System description: TPS: A theorem proving system for type theory

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1831, Issue , 2000, Pages 164-169

  Andrews, Peter B ^a   Bishop, Matthew ^b   Brown, Chad E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937433539     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10721959_11     Document Type: Conference Paper

References (15)

1. Peter B. Andrews. Theorem Proving via General Matings. Journal of the ACM, 28: 193-214, 1981.
2. Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.
3. Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, and Hongwei Xi. TPS: A Theorem Proving System for Classical Type Theory. Journal of Automated Reasoning, 16: 321-353, 1996.
4. Wolfgang Bibel. Automated Theorem Proving. Vieweg, Braunschweig, second edi-Tion, 1987.
5. Matthew Bishop. A Breadth-First Strategy for Mating Search. In Harald Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction, volume 1632 of Lecture Notes in Artificial Intelligence, pages 359-373, Trento, Italy, 1999. Springer-Verlag.
6. Matthew Bishop. Mating Search Without Path Enumeration. PhD thesis, De-partment of Mathematical Sciences, Carnegie Mellon University, April 1999. De-partment of Mathematical Sciences Research Report No. 99-223. Available at http://gtps.math.cmu.edu/tps.html.
7. Matthew Bishop and Peter B. Andrews. Selectively Instantiating Definitions. In Claude Kirchner and Héléne Kirchner, editors, Proceedings of the 15th Interna-Tional Conference on Automated Deduction, volume 1421 of Lecture Notes in Ar-Tificial Intelligence, pages 365-380, Lindau, Germany, 1998. Springer-Verlag.
8. Alonzo Church. A Formulation of the Simple Theory of Types. Journal of Symbolic Logic, 5: 56-68, 1940.
9. Sunil Issar. Path-Focused Duplication: A Search Procedure for General Matings. In AAAI-90. Proceedings of the Eighth National Conference on Artificial Intelligence, volume 1, pages 221-226. AAAI Press/The MIT Press, 1990.
10. Sunil Issar. Operational Issues in Automated Theorem Proving Using Matings. PhD thesis, Carnegie Mellon University, 1991. 147 pp.
11. Dale A. Miller. A Compact Representation of Proofs. Studia Logica, 46 (4) : 347-370, 1987.
12. Lawrence Paulson and Krzystztof Grabczewski. Mechanising Set Theory: Cardinal Arithmetic and the Axiom of Choice. Journal of Automated Reasoning, 17: 291-323, 1996.
13. Frank Pfenning. Proof Transformations in Higher-Order Logic. PhD thesis, Carnegie Mellon University, 1987. 156 pp.
14. Frank Pfenning and Dan Nesmith. Presenting Intuitive Deductions via Symmet-ric Simplification. In M. E. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, volume 449 of Lecture Notes in Artificial Intelligence, pages 336-350, Kaiserslautern, Germany, 1990. Springer-Verlag.
15. Herman Rubin and Jean E. Rubin. Equivalents of the Axiom of Choice, II. North-Holland, 1985.