论文信息 - A Prototype Proof Translator from HOL to Coq

A Prototype Proof Translator from HOL to Coq

We describe a low-level proof format, which can be used for independent proof checking and as an intermediate language for translating proofs between systems. The checker is presented as a virtual machine and the proof format as the bytecode. We compare HOL and Coq with a view to designing this pivot language, and describe a prototype which converts recorded HOL proofs into this intermediate format, and then translates them into Coq.

Ewen Denney

[1] Furio Honsell,et al. A framework for defining logics , 1993, JACM.

[2] Fausto Giunchiglia,et al. Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems , 1994, FroCoS.

[3] Vincent Zammit,et al. A Comparative Study of Coq and HOL , 1997, TPHOLs.

[4] Henk Barendregt,et al. The quest for correctness , 1996 .

[5] Richard J. Boulton,et al. An Interface between Clam and HOL , 1998, TPHOLs.

[6] Amy P. Felty,et al. Hybrid Interactive Theorem Proving Using Nuprl and HOL , 1997, CADE.

[7] Hugo Herbelin,et al. The Coq proof assistant : reference manual, version 6.1 , 1997 .

[8] Volker Sorge,et al. Agent-Oriented Integration of Distributed Mathematical Services , 1999, J. Univers. Comput. Sci..

[9] Wai Wong,et al. Validation of HOL Proofs by Proof Checking , 1999, Formal Methods Syst. Des..

[10] George C. Necula,et al. Efficient representation and validation of proofs , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[11] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .