Implementing hash-consed structures in Coq - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Implementing hash-consed structures in Coq


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.
Fichier principal
Vignette du fichier
Braibant_Jourdan_Monniaux_ITP2013.pdf (115.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00816672 , version 1 (22-04-2013)



Thomas Braibant, Jacques-Henri Jourdan, David Monniaux. Implementing hash-consed structures in Coq. Interactive Theorem Proving, 4th international conference, Jul 2013, Rennes, France. pp.477-483, ⟨10.1007/978-3-642-39634-2_36⟩. ⟨hal-00816672⟩
381 View
359 Download



Gmail Mastodon Facebook X LinkedIn More