David Monniaux

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Thomas Braibant

> Home > Persons > David Monniaux

Publications

2014
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/jar/BraibantJM14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jar/BraibantJM14
Thomas Braibant, Jacques-Henri Jourdan, David Monniaux:
Implementing and Reasoning About Hash-consed Data Structures in Coq. J. Autom. Reason. 53(3): 271-304 (2014)
2013
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/itp/BraibantJM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itp/BraibantJM13
Thomas Braibant, Jacques-Henri Jourdan, David Monniaux:
Implementing Hash-Consed Structures in Coq. ITP 2013: 477-483
[i19]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1304-6038
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1304-6038
Thomas Braibant, Jacques-Henri Jourdan, David Monniaux:
Implementing hash-consed structures in Coq. CoRR abs/1304.6038 (2013)
[i18]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/BraibantJM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BraibantJM13
Thomas Braibant, Jacques-Henri Jourdan, David Monniaux:
Implementing and reasoning about hash-consed data structures in Coq. CoRR abs/1311.2959 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.