Translating HOL to Dedukti

Research paper by Ali Assaf, Guillaume Burel

Indexed on: 30 Jul '15Published on: 30 Jul '15Published in: Computer Science - Logic in Computer Science


Dedukti is a logical framework based on the lambda-Pi-calculus modulo rewriting, which extends the lambda-Pi-calculus with rewrite rules. In this paper, we show how to translate the proofs of a family of HOL proof assistants to Dedukti. The translation preserves binding, typing, and reduction. We implemented this translation in an automated tool and used it to successfully translate the OpenTheory standard library.