A prototype proof translator from hol to coq

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

Volumn 1869, Issue , 2000, Pages 108-125

  Denney, Ewen ^a  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; TRANSLATION (LANGUAGES);

BYTECODES; INTERMEDIATE FORMATS; INTERMEDIATE LANGUAGES; PIVOT LANGUAGE; PROOF CHECKING;

THEOREM PROVING;

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

References (13)

1. A. Franke A.S.M. Hess, G.Ch. Jung, M. Kohlhase, and V. Sorge. Gent-oriented integration of distributed mathematical services. Journal of Universal Computer Science, 5, 2000.
2. Henk Barendregt. The quest for correctness. Ima- ges of SMC research, pages 39-58, 1996. At ftp://ftp.cs.kun.nl/pub/CompMath.Found/quest.ps.Z.
3. Bruno Barras, Samuel Boutin, Cristina Cornes, Jean-Christophe Filliatre, Eduardo Gimenez, Hugo Herbelin, Gerard Huet, Cesar Mufioz, Chetan Murthy, Catherine Parent, Christine Paulin-Mohring, Amokrane Saibi, and Benjamin Werner. The Coq Proof Assistant Reference Manual: Version 6.1. Technical Report RT-0203, Inria, May 1997.
4. Robert S. Boyer and Gilles Dowek. Towards checking proof-checkers. In Workshop on Types for Proofs and Programs (Type '93), 1993.
5. R. Boulton, K. Slind, A. Bundy, and M. Gordon. An interface between CLAM and HOL. In J. Grundy and M. Newey, editors, Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'98), volume 1479 of Lecture Notes in Computer Science, pages 87-104, Canberra, Australia, September/October 1998. Springer- Verlag.
6. O. Caprotti, D.P. Carlisle, and A.M. Cohen. Draft of the Open Math standard. The Open Math Society, 1999. http://www.nag.co.uk/projects/openmath/omsoc/.
7. A. P. Felty and D. J. Howe. Hybrid interactive theorem proving using Nuprl and HOL. In William McCune, editor, Proceedings of the 14th International Conference on Automated deduction, volume 1249 of LNAI, pages 351-365, Berlin, July 13-17 1997. Springer-Verlag.
8. M. J. C. Gordon and Thomas F. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
9. Fausto Giunchiglia, Paolo Pecchiari, and Carolyn Talcott. Reasoning theories: Towards an architecture for open mechanized reasoning systems. Technical Note CS-TN-94-15, Stanford University, Department of Computer Science, December 1994.
10. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. In Symposium on Logic in Computer Science, Ithaca, NY, pages 194-204. IEEE, June 1987.
11. Necula and Lee. Efficient representation and validation of proofs. In LICS: IEEE Symposium on Logic in Computer Science, pages 93-104, 1998.
12. Wai Wong. Validation of HOL proofs by proof checking. Formal Methods in System Design: An International Journal, 14(2):193-212, March 1999.
13. Vincent Zammit. A comparative study of Coq and HOL. In Elsa L. Gunter and Amy Felty, editors, Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs'97, Murray Hill, NJ, USA, volume 1275 of Lecture Notes in Computer Science, pages 323-337. Springer-Verlag, August 1997.