Extensible Hierarchical Tactic Construction in a Logical Framework

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

Volumn 3223, Issue , 2004, Pages 136-151

  Hickey, Jason ^a   Nogin, Aleksey ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; OPEN SYSTEMS;

AUTOMATED PROOFS; CONSTRUCTION METHODOLOGY; FIXED BASE; FLEXIBLE MECHANISMS; HIGHER ORDER LOGIC; LOGICAL FRAMEWORKS; PAPER FORMS; THEOREM PROVERS;

THEOREM PROVING;

EID: 33747226679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30142-4_11     Document Type: Article

References (20)

1. th International Conference on Automated Deduction, volume 1831 of Lecture Notes in Artificial Intelligence, pages 170-176. Springer Verlag, 2000.
2. Bruno Barras, Samuel Boutin, Cristina Comes, Judicaël Courant, Jean-Christophe Filliâtre, Eduardo Gimenez, Hugo Herbelin, Gérard-Mohring, Amokrane Saïbi, and Benjamin Werner. The Coq Proof Assistant Reference Manual. INRIARocquencourt, CNRS and ENS Lyon, 1996.
3. Jim Christian. Flatterms, discrimination nets, and fast term rewriting. Journal of Automated Reasoning, 10(1):95-113, February 1993.
4. Robert L. Constable, Stuart F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, Douglas J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, James T. Sasaki, and Scott F. Smith. Implementing Mathematics with the NuPRL Proof Development System. Prentice-Hall, NJ, 1986.
5. Judy Crow, Sam Owre, John Rushby, Natarajan Shankar, and Mandayam 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.
6. Michael Gordon and Tom Melham. Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, Cambridge, 1993.
7. Peter Graf. Term Indexing, volume 1053 of Lecture Notes in Artificial Intelligence. Springer, 1995.
8. Jason Hickey and Aleksey Nogin. Extensible pretty-printer specifications. In preparation.
9. th International Conference, on Theorem Proving in Higher Order Logics (TPHOLs 2003), volume 2758 of Lecture Notes in Computer Science, pages 287-303. Springer-Verlag, 2003.
10. th International Conference on Automated Deduction, volume 1249 of Lecture Notes in Artificial Intelligence, pages 395-399. Springer, July 13-17 1997. An extended version of the paper can be found at http://www.cs.caltech. edu/~jyh/papers/cadel4_nl/default.html.
11. Jason J. Hickey, Brian Aydemir, Yegor Bryukhov, Alexei Kopylov, Aleksey Nogin, and Xin Yu. A listing of MetaPRL theories, http://metaprl.org/theories. pdf.
12. th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 252-266. Springer-Verlag, 2000.
13. Jason J. Hickey, Aleksey Nogin, Alexei Kopylov, et al. MetaPRL home page. http://metaprl.org/.
14. Paul B. Jackson. Enhancing the NuPRL Proof Development System and Applying it to Computational Abstract Algebra. PhD thesis, Cornell University, Ithaca, NY, January 1995.
15. Xavier Leroy. The Objective Caml system release 1.07. INRIA, France, May. 1997.
16. th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002), volume 2410 of Lecture Notes in Computer Science, pages 281-297. SpringerVerlag, 2002.
17. L. Paulson and T. Nipkow. Isabelle tutorial and user's manual. Technical report, University of Cambridge Computing Laboratory, 1990.
18. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1994.
19. Mark Utting, Peter Robinson, and Ray Nickson. Ergo 6: A generic proof engine that uses Prolog proof technology. Journal of Computation and Mathematics, 5:194-219, 2002.
20. Pierre Weis and Xavier Leroy. Le langage Caml. Dunod, Paris, 2nd edition, 1999. In French.