Fast tactic-based theorem proving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1869, Issue , 2000, Pages 252-267

  Hickey, Jason ^a   Nogin, Aleksey ^b  

^a Department of Computer Science ^*  (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

AUTOMATED PROOFS; EFFICIENT DATA STRUCTURES; HIGHER ORDER LOGIC; LOGICAL FRAMEWORKS; ORDERS OF MAGNITUDE; PERFORMANCE PENALTIES; PROOF PROCEDURES; THEOREM PROVERS;

THEOREM PROVING;

EID: 84949196260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44659-1_16     Document Type: Conference Paper

References (19)

1. Peter Aczel. The type theoretic interpretation of constructive set theory: Inductive definition. In Logic, Methodology and Philosophy of Science VII, pages 17-49. Elsevier Science Publishers, 1986.
2. Stuart F. Allen, Robert L. Constable, Douglas J. Howe, and William Aitken. The semantics of reflected proof. In Proceedings of the Fifth Symposium on Logic in Computer Science, pages 95-197. IEEE, June 1990.
3. Bruno Barras, Samuel Boutin, Cristina Comes, Judicael Courant, Jean-Christophe Filliatre, Eduardo Gimenez, Hugo Herbelin, Gerard-Mohring, Amokrane Saibi, and Benjamin Werner. The Coq Proof Assistant Reference Manual. INRIA-Rocquencourt, CNRS and ENS Lyon, 1996.
4. David A. Basin and M. Kaufmann. The Boyer-Moore prover and Nuprl: An experimental comparison. In Gerard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 89-119. Cambridge University Press, 1991.
5. J. L. Bates. A Logic for Correct Program Development. PhD thesis, Cornell University, 1979.
6. R. S. Boyer and J. S. Moore. A Computational Logic. Academic Press, New York, 1979.
7. Robert L. Constable, T. Knoblock, and J.L. Bates. Writing programs that construct proofs. J. Automated Reasoning, l(3):285-326, 1984.
8. Thierry Coquand, Bengt Nordstrom, Jan M. Smith, and Bjorn von Sydow. Type Theory and Programming. EATCS, February 1994. bulletin no 52.
9. Judy Crow, Sam Owre, John Rushby, Natarajan Shankar, and Man-dayam Srivas. A Tutorial Introduction to PVS. In WIFT '95: Workshop on Industrial-Strength Formal Specification Techniques, April 1995. http://www.csl.sri.com/sri-csl-fm.html.
10. R. Dyckhoff. Contraction-free sequent calculi for intuitionistic logic. In The Journal of Symbolic Logic, pages Vol. 57, Number 3, September 1992.
11. R.L. Constable et al. Implementing Mathematics in the NuPRL Proof Development System. Prentice—Hall, 1986.
12. M.J.C. Gordon and T.F. Melham. Introduction to HOL. Cambridge University Press, 1993.
13. John Harrison. HOL Light: A tutorial introduction. In Formal Methods in Computer-Aided Design (FMCAD'96), pages 265-269. Springer LNCS 1166, 1996.
14. Jason Hickey. Fault-tolerant distributed theorem proving. In Harald Ganzinger, editor, Automated Deduction - CADE-16, 16th International Conference on Automated Deduction, LNAI 1632, pages 227-231, Trento, Italy, July 7-10, 1999. Springer-Verlag.
15. Jason J. Hickey. Nuprl-Light: An implementation framework for higher-order logics. In 14-th International Conference on Automated Deduction. Springer, 1997.
16. Douglas J. Howe. A type annotation scheme for Nuprl. In Theorem Proving in Higher-Order Logics. Springer, 1998.
17. Matt Kaufmann and J. Moore. An industrial strength theorem prover for a logic based on common lisp. IEEE Transactions on Software Engineering, 23(4):203-213, April 1997.
18. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover. Springer LNCS 828, 1994.
19. Pierre Weis and Xavier Leroy. Le langage Caml. Dunod, Paris, 2nd edition, 1999. In French.