An interpretation of isabelle/HOL in 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 192-204

  McLaughlin, Sean ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; STANDARDS;

HOL LIGHT OBJECT LOGIC; INTERPRETATION; METALANGUAGE; STANDARD LIBRARY;

LOGIC PROGRAMMING;

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

References (34)

1. http://www.es.cmu.edu/~{}seanmcl/projects/logosphere/isabelle-holl.
2. J. Avigad, K. Donnelly, D. Gray, and P. Raff. A formally verified proof of the prime number theorem. To appear in the ACM Transactions on Computational Logic.
3. C. Ballarin. Locales and locale expressions in Isabelle/Isar. In S. B. et al, editor, Types for Proofs and Programs: International Workshop, 2003.
4. Y. Bertot and P. Castéran. CoqÁrt: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer, 2004.
5. N. G. d. Bruijn. A survey of the project AUTOMATH. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, pages 589-606. Academic Press, 1980.
6. R. Constable. Implementing Mathematics with The Nuprl Proof Development System. Prentice-Hall, 1986.
7. D. J. Howe. Importing mathematics from HOL into Nuprl. In J. Von Wright, J. Grundy, and J. Harrison, editors, Ninth International Conference on Theorem Proving in Higher Order Logics TPHOL, volume LNCS 1125, pages 267-282, Turku, Finland, 1996. Springer Verlag.
8. A. P. Felty and D. J. Howe. Hybrid interactive theorem proving using Nuprl and HOL. In Fourteenth International Conference on Automated Deduction, pages 351-365. Springer-Verlag Lecture Notes in Computer Science, 1997.
9. G. Gonthier. A computer-checked proof of the four colour theorem. Available on the Web via http://research.microsoft.com/~gonthier/, 2005.
10. M. J. C. Gordon and T. F. Melham. Introduction to HOL: a theorem proving environment for higher order logic. Cambridge University Press, 1993.
11. T. Hales. The Flyspeck Project fact sheet. Project description available at http://www.math.pitt.edu/~thales/flyspeck/, 2005.
12. T. Hales. The Jordan Curve Theorem in HOL Light. Source code available at http://www.math.pitt.edu/~thales/, 2005.
13. T. C. Hales. A proof of the the Kepler conjecture. Annals of Mathematics, 162:1065-1185, 2005.
14. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. In Proceedings of the Second Annual Symposium on Logic in Computer Science, pages 194-204, Ithaca, NY, 1987. IEEE Computer Society Press.
15. R. Harper and B. C. Pierce. Design issues in advanced module systems. In B. C. Pierce, editor, Advanced Topics in Types and Programming Languages. MIT Press, 2005.
16. 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.
17. E. Landau. Grundlagen der Analysis. Leipzig, 1930
18. . English translation by F. Steinhardt: 'Foundations of analysis: the arithmetic of whole, rational, irrational, and complex numbers. A supplement to textbooks on the differential and integral calculus', published by Chelsea; 3rd edition 1966.
19. S. McLaughlin, C. Barrett, and Y. Ge. Cooperating theorem provers: A case study combining CVC Lite and HOL Light. In A. Armando and A. Cimatti, editors, Proceedings of the Third Workshop on Pragmatics of Decision Procedures in Automated Reasoning, volume 144, pages 43-51, 2005.
20. R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. The MIT Press, 1990.
21. P. Naumov. Importing Isabelle formal mathematics into Nuprl. Technical Report TR99-1734, Cornell University, 26, 1999.
22. P. Naumov, M.-O. Stehr, and J. Meseguer. The HOL/NuPRL proof translator - a practical approach to formal interoperability. In Theorem Proving in Higher Order Logics, 14th International Conference, volume 2152 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
23. T. Nipkow, G. Bauer, and P. Schultz. Flyspeck I: Tame Graphs. Technical report, Institut für Informatik, TU München, Jan. 2006.
24. S. Obua and S. Skalberg. Importing HOL into Isabelle/HOL. submitted, 2006.
25. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Computer Science, pages 748-752, Saratoga, NY, 1992. Springer-Verlag.
26. L. C. Paulson. Isabelle: a generic theorem prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994. With contributions by Tobias Nipkow.
27. F. Pfenning. Logical frameworks. In Handbook of Automated Reasoning, pages 1063-1147. MIT Press, 2001.
28. F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framweork for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction, pages 202-206, 1999.
29. F. Pfenning, C. Schürmann, M. Kohlhase, N. Shankar, and S. Owre. The Logosphere Project. Project description available at http://www.logosphere.org, 2005.
30. C. Schürmann and M.-O. Stehr. An Executable Formalization of the HOL/NuPRL Connection in Twelf. In 11th International Conference on Logic for Programming Artificial Intelligence and Reasoning, 2005.
31. M.-O. Stehr, P. Naumov, and J. Meseguer. A proof-theoretic approach to the HOLNuPRL connection with applications to proof-translation. In WADT/CoFI'01, 2001.
32. P. Weis and X. Leroy. Le langage Caml. InterEditions, 1993. See also the CAML Web page: http://pauillac.inria.fr/caml/.
33. M. Wenzel. Type Classes and Overloading in Higher-Order Logic. In E. Gunter and A. Felty, editors, TPHOLs '97, pages 307-322, Murray Hill, New Jersey, 1997.
34. A. N. Whitehead and B. Russell. Principia Mathematica (3 vols). Cambridge University Press, 1910.