Translating HOL to Dedukti
Logic in Computer Science
2015-08-03 v1
Abstract
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.
Cite
@article{arxiv.1507.08720,
title = {Translating HOL to Dedukti},
author = {Ali Assaf and Guillaume Burel},
journal= {arXiv preprint arXiv:1507.08720},
year = {2015}
}
Comments
In Proceedings PxTP 2015, arXiv:1507.08375