Work

Translating HOL to Dedukti

Year: 2015

Type: article

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.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.186.8

Authors: Ali Assaf, Guillaume Burel

Institutions: Institut national de recherche en sciences et technologies du numérique, École Polytechnique, École Nationale Supérieure d’Informatique pour l’Industrie et l’Entreprise, Centre d'études et de recherche en informatique et communications

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2199020582

FWCI: 2.189

Cites: 20

Cited by: 14

Related to: