Importing HOL light into Coq

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

Volumn 6172 LNCS, Issue , 2010, Pages 307-322

  Keller, Chantal ^a,b   Werner, Benjamin ^b  

^a UNIVERSITÉ DE LYON   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

HIGHER ORDER LOGIC; MATHEMATICAL STATEMENT; PROOF SYSTEM; TYPE THEORY;

THEOREM PROVING;

EID: 77955265277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14052-5_22     Document Type: Conference Paper

References (22)

1. Our implementation, http://perso.ens-lyon.fr/chantal.keller/Recherche/ hollightcoq.html
2. Dedukti, a universal proof checker, http://www.lix.polytechnique.fr/ dedukti
3. The Flyspeck project, http://www.flyspeck-blog.blogspot.com
4. Aagaard, M., Harrison, J. (eds.): TPHOLs 2000. LNCS, vol. 1869. Springer, Heidelberg (2000)
5. Aydemir, B., Charguéraud, A., Pierce, B., Pollack, R., Weirich, S.: Engineering formal metatheory. In: Necula, G., Wadler, P. (eds.) POPL, pp. 3-15. ACM, New York (2008)
6. Barras, B., Boutin, S., Cornes, C., Courant, J., Filliatre, J., Gimenez, E., Herbelin, H., Huet, G., Munoz, C., Murthy, C., et al.: The Coq proof assistant: reference manual. Rapport technique - INRIA (2000)
7. Berger, U., Schwichtenberg, H.: An inverse of the evaluation functional for typed lambda-calculus. In: LICS, pp. 203-211. IEEE Computer Society, Los Alamitos (1991)
8. Berghofer, S., Nipkow, T.: Proof terms for simply typed higher order logic. In: Aagaard, Harrison: [4], pp. 38-52
9. Denney, E.: A prototype proof translator from hol to coq. In: Aagaard, Harrison: [4], pp. 108-125
10. Filliâtre, J.C., Conchon, S.: Type-safe modular hash-consing. In: Kennedy, A., Pottier, F. (eds.) ML, pp. 12-19. ACM, New York (2006)
11. Furbach, U., Shankar, N. (eds.): IJCAR 2006. LNCS (LNAI), vol. 4130. Springer, Heidelberg (2006)
12. Garillot, F., Werner, B.: Simple types in type theory: Deep and shallow encodings. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 368-382. Springer, Heidelberg (2007)
13. Gonthier, G., Mahboubi, A.: A Small Scale Reflection Extension for the Coq system. Tech. rep., INRIA (2007)
14. Gordon, M., Melham, T.: Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, New York (1993)
15. Harrison, J.: HOL Light: A tutorial introduction. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 265-269. Springer, Heidelberg (1996)
16. Harrison, J.: Towards self-verification of HOL Light. In: Furbach, Shankar: [11], pp. 177-191
17. Hurd, J.: OpenTheory: Package Management for Higher Order Logic Theories. In: PLMMS'09, p. 31 (2009)
18. Leroy, X.: The OCaml Programming Language (1998)
19. Obua, S., Skalberg, S.: Importing HOL into Isabelle/HOL. In: Furbach, Shankar: [11], pp. 298-302
20. Wiedijk, F.: Encoding the HOL Light logic in Coq. Unpublished notes (2007)
21. Wong, W.: Recording and checking HOL proofs. In: Schubert, E., Windley, P., Alves-Foss, J. (eds.) TPHOLs 1995. LNCS, vol. 971, pp. 353-368. Springer, Heidelberg (1995)
22. Zammit, V.: A comparative study of Coq and HOL. In: Gunter, E., Felty, A. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 323-337. Springer, Heidelberg (1997)