Implementing and reasoning about hash-consed data structures in Coq

Abstract : We report on four different approaches to implementing hash-consing in Coq programs. The use cases include execution inside Coq, or execution of the extracted OCaml code. We explore the 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. We use the running example of binary decision diagrams and then demonstrate the generality of our solutions by applying them to other examples of hash-consed data structures.
Keywords : Coq BDD Hash-consing
Complete list of metadatas
Contributor : Thomas Braibant <>
Submitted on : Friday, March 7, 2014 - 4:42:23 PM
Last modification on : Friday, July 6, 2018 - 10:08:02 AM
Long-term archiving on : Saturday, June 7, 2014 - 11:42:09 AM


Files produced by the author(s)


  • HAL Id : hal-00881085, version 2
  • ARXIV : 1311.2959


Thomas Braibant, Jacques-Henri Jourdan, David Monniaux. Implementing and reasoning about hash-consed data structures in Coq. 2014. ⟨hal-00881085v2⟩



Record views


Files downloads