Towards self-verification of HOL light

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

Volumn 4130 LNAI, Issue , 2006, Pages 177-191

  Harrison, John ^a  

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SEMANTICS; SET THEORY; THEOREM PROVING;

DEFINITIONAL MECHANISMS; FORMAL VERIFICATION; HIGHER ORDER LOGIC; SET THEORETIC SEMANTICS;

LOGIC PROGRAMMING;

EID: 33749553558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_17     Document Type: Conference Paper

References (23)

1. P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.
2. H. Barendregt. The impact of the lambda calculus on logic and computer science. Bulletin of Symbolic Logic, 3:181-215, 1997.
3. A. Church. A formulation of the Simple Theory of Types. Journal of Symbolic Logic, 5:56-68, 1940.
4. P. J. Davis. Fidelity in mathematical discourse: Is one and one really two? The American Mathematical Monthly, 79:252-263, 1972.
5. R. Diaconescu. Axiom of choice and complementation. Proceedings of the American Mathematical Society, 51:176-178, 1975.
6. E. W. Dijkstra. Formal techniques and sizeable programs (EWD563). In E. W. Dijkstra, editor, Selected Writings on Computing: A Personal Perspective, pages 205-214. Springer-Verlag, 1976. Paper prepared for Symposium on the Mathematical Foundations of Computing Science, Gdansk 1976.
7. T. Forster. Reasoning about theoretical entities, volume 3 of Advances in Logic. World Scientific, 2003.
8. M. J. C. Gordon. Representing a logic in the LCF metalanguage. In D. Néel, editor, Tools and notions for program construction: an advanced course, pages 163-185. Cambridge University Press, 1982.
9. M. J. C. Gordon and T. F. Melham. Introduction to HOL: a theorem proving environment for higher order logic. Cambridge University Press, 1993.
10. M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of Lecture Notes in Computer Science. Springer-Verlag, 1979.
11. J. Harrison. HOL Light: A tutorial introduction. In M. Srivas and A. Camilleri, editors, Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FMCAD'96), volume 1166 of Lecture Notes in Computer Science, pages 265-269. Springer-Verlag, 1996.
12. J. Lambek and P. J. Scott. Introduction to higher order categorical logic, volume 7 of Cambridge studies in advanced mathematics. Cambridge University Press, 1986.
13. M. Lecat. Erreurs de Mathématiciens. Brussels, 1935.
14. W. McCune and O. Shumsky. Ivy: A preprocessor and proof checker for first-order logic. In M. Kaufmann, P. Manolios, and J. S. Moore, editors, Computer-Aided Reasoning: ACL2 Case Studies, pages 265-281. Kluwer, 2000.
15. T. F. Melham. The HOL logic extended with quantification over type variables. In L. J. M. Claesen and M. J. C. Gordon, editors, Proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and its Applications, volume A-20 of IFIP Transactions A: Computer Science and Technology, pages 3-18, IMEC, Leuven, Belgium, 1992. North-Holland.
16. R. Pollack. How to believe a machine-checked proof. In G. Sambin and J. Smith, editors, Twenty-Five Years of Constructive Type Theory. Oxford University Press, 1998. Also available on the Web as http://www.brics.dk/~-pollack/export/ believing.ps.gz.
17. T. Ridge. A mechanically verified, efficient, sound and complete theorem prover for first order logic, Available via http://homepages.inf.ed.ac.uk/ s0128214/, 2005.
18. P. Rudnicki. An overview of the MIZAR project. Available on the Web as http://web.cs.ualberta.ca/~piotr/Mizar/MizarOverview.ps, 1992.
19. D. Scott. A type-theoretical alternative to ISWIM, CUCH, OWHY, Theoretical Computer Science, 121:411-440, 1993. Annotated version of a 1969 manuscript.
20. K. Slind. Reasoning about terminating functional programs, PhD thesis, Institut für Informatik, Technische Universität München, 1999. Available from http://tumb1.biblio.tu-muenchen.de/publ/diss/in/1999/slind.html.
21. R. M. Smullyan. Gödel's Incompleteness Theorems, volume 19 of Oxford Logic Guides. Oxford University Press, 1992.
22. W. Wong. Recording HOL proofs. Technical Report 306, University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK, 1993.
23. J. von Wright. Representing higher-order logic proofs in HOL, In T. F. Melham and J. Camilleri, editors, Higher Order Logic Theorem Proving and Its Applications: Proceedings of the 7th International Workshop, volume 859 of Lecture Notes in Computer Science, pages 456-470, Valletta, Malta, 1994. Springer-Verlag.