Implementing hash-consed structures in Coq

Abstract : We report on three different approaches to use hash-consing in programs certified with the Coq system, using binary decision diagrams (BDD) as running example. The use cases include execution inside Coq, or execution of the extracted OCaml code. There are different trade-offs between faithful use of pristine extracted code, and code that is fine-tuned to make use of OCaml programming constructs not available in Coq. We discuss the possible consequences in terms of performances and guarantees.
Keywords : Coq OCaml hash-consing BDD
Type de document :
Communication dans un congrès
Sandrine Blazy and Christine Paulin-Mohring and David Pichardie. Interactive Theorem Proving, 4th international conference, Jul 2013, Rennes, France. Springer, 7998, pp.477-483, 2013, Lecture notes in computer science. 〈10.1007/978-3-642-39634-2_36〉
Liste complète des métadonnées

Littérature citée [5 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00816672
Contributeur : David Monniaux <>
Soumis le : lundi 22 avril 2013 - 16:43:33
Dernière modification le : mercredi 15 novembre 2017 - 09:56:02
Document(s) archivé(s) le : mardi 23 juillet 2013 - 04:14:07

Fichiers

Braibant_Jourdan_Monniaux_ITP2...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

IMAG | INRIA | UGA

Citation

Thomas Braibant, Jacques-Henri Jourdan, David Monniaux. Implementing hash-consed structures in Coq. Sandrine Blazy and Christine Paulin-Mohring and David Pichardie. Interactive Theorem Proving, 4th international conference, Jul 2013, Rennes, France. Springer, 7998, pp.477-483, 2013, Lecture notes in computer science. 〈10.1007/978-3-642-39634-2_36〉. 〈hal-00816672〉

Partager

Métriques

Consultations de la notice

438

Téléchargements de fichiers

233