HTTP/1.1 200 OK
Date: Fri, 25 Mar 2016 15:53:56 GMT
Server: Apache
Strict-Transport-Security: max-age=15768000
Content-Encoding: gzip
Vary: Accept-Encoding
Access-Control-Allow-Origin: *
Content-Length: 5317
Keep-Alive: timeout=5, max=100
Connection: Keep-Alive
Content-Type: application/json; charset=utf-8

{"response":{"numFound":541,"start":0,"docs":[{"label_bibtex":"@techreport{barras:inria-00069968,\n  TITLE = {{The Coq Proof Assistant Reference Manual : Version 6.1}},\n  AUTHOR = {Barras, Bruno and Boutin, Samuel and Cornes, Cristina and Courant, Judica{\\\"e}l and Filli{\\^a}tre, Jean-Christophe and Gim{\\'e}nez, Eduardo and Herbelin, Hugo and Huet, G{\\'e}rard and Mu{\\~n}oz, C{\\'e}sar and Murthy, Chetan and Parent, Catherine and Paulin-Mohring, Christine and Sa{\\\"i}bi, Amokrane and Werner, Benjamin},\n  URL = {https://hal.inria.fr/inria-00069968},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RT-0203},\n  PAGES = {214},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1997},\n  MONTH = May,\n  KEYWORDS = {FORMAL PROOFS ; CALCULUS OF INDUCTIVES CONSTRUCTIONS ; COQ ; PROOF ASSISTANT},\n  PDF = {https://hal.inria.fr/inria-00069968/file/RT-0203.pdf},\n  HAL_ID = {inria-00069968},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Coq Proof Assistant Reference Manual : Version 6.1"],"halId_s":"inria-00069968","uri_s":"https://hal.inria.fr/inria-00069968","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Bruno Barras","Samuel Boutin","Cristina Cornes","Judicaël Courant","Jean-Christophe Filliâtre","Eduardo Giménez","Hugo Herbelin","Gérard Huet","César Muñoz","Chetan Murthy","Catherine Parent","Christine Paulin-Mohring","Amokrane Saïbi","Benjamin Werner"]},{"label_bibtex":"@techreport{huet:inria-00069967,\n  TITLE = {{The Coq Proof Assistant : A Tutorial : Version 6.1}},\n  AUTHOR = {Huet, G{\\'e}rard and Kahn, Gilles and Paulin-Mohring, Christine},\n  URL = {https://hal.inria.fr/inria-00069967},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RT-0204},\n  PAGES = {44},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1997},\n  MONTH = Aug,\n  KEYWORDS = {FORMAL PROOFS ; CALCULUS OF INDUCTIVES CONSTRUCTIONS ; COQ ; PROOF ASSISTANT},\n  PDF = {https://hal.inria.fr/inria-00069967/file/RT-0204.pdf},\n  HAL_ID = {inria-00069967},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Coq Proof Assistant : A Tutorial : Version 6.1"],"halId_s":"inria-00069967","uri_s":"https://hal.inria.fr/inria-00069967","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Gérard Huet","Gilles Kahn","Christine Paulin-Mohring"]},{"label_bibtex":"@techreport{huet:inria-00069918,\n  TITLE = {{The Coq Proof Assistant : A Tutorial : Version 7.2}},\n  AUTHOR = {Huet, G{\\'e}rard and Kahn, Gilles and Paulin-Mohring, Christine},\n  URL = {https://hal.inria.fr/inria-00069918},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RT-0256},\n  PAGES = {46},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2002},\n  MONTH = Feb,\n  KEYWORDS = {PROOF ASSISTANT ; FORMAL PROOFS ; CALCULUS OF INDUCTIVES CONSTRUCTIONS ; COQ},\n  PDF = {https://hal.inria.fr/inria-00069918/file/RT-0256.pdf},\n  HAL_ID = {inria-00069918},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Coq Proof Assistant : A Tutorial : Version 7.2"],"halId_s":"inria-00069918","uri_s":"https://hal.inria.fr/inria-00069918","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Gérard Huet","Gilles Kahn","Christine Paulin-Mohring"]},{"label_bibtex":"@techreport{verma:inria-00072797,\n  TITLE = {{Reflecting BDDs in Coq}},\n  AUTHOR = {Verma, Kumar Neeraj and Goubault-Larrecq, Jean},\n  URL = {https://hal.inria.fr/inria-00072797},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RR-3859},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2000},\n  KEYWORDS = {EXTRACTION ; COQ ; PROOF ; REFLECTION ; BINARY DECISION DIAGRAMS ; BDD ; CAML},\n  PDF = {https://hal.inria.fr/inria-00072797/file/RR-3859.pdf},\n  HAL_ID = {inria-00072797},\n  HAL_VERSION = {v1},\n}\n","title_s":["Reflecting BDDs in Coq"],"halId_s":"inria-00072797","uri_s":"https://hal.inria.fr/inria-00072797","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Kumar Neeraj Verma","Jean Goubault-Larrecq"]},{"label_bibtex":"@techreport{cornes:inria-00069994,\n  TITLE = {{The Coq Proof Assistant, Reference Manual, Version 5.10}},\n  AUTHOR = {Cornes, Cristina and Courant, Judica{\\\"e}l and Filli{\\^a}tre, Jean-Christophe and Huet, G{\\'e}rard and Manoury, Pascal and Munoz, C{\\'e}sar and Murthy, Chetan and Parent, Catherine and Paulin-Mohring, Christine and Saibi, Amokrane and Werner, Benjamin},\n  URL = {https://hal.inria.fr/inria-00069994},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RT-0177},\n  PAGES = {185},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1995},\n  PDF = {https://hal.inria.fr/inria-00069994/file/RT-0177.pdf},\n  HAL_ID = {inria-00069994},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Coq Proof Assistant, Reference Manual, Version 5.10"],"halId_s":"inria-00069994","uri_s":"https://hal.inria.fr/inria-00069994","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Cristina Cornes","Judicaël Courant","Jean-Christophe Filliâtre","Gérard Huet","Pascal Manoury","César Munoz","Chetan Murthy","Catherine Parent","Christine Paulin-Mohring","Amokrane Saibi","Benjamin Werner"]},{"label_bibtex":"@techreport{saibi:inria-00074332,\n  TITLE = {{Axiomatisation d'un Lambda-Calcul avec Substitutions Explicites dans Coq}},\n  AUTHOR = {Saibi, Amokrane},\n  URL = {https://hal.inria.fr/inria-00074332},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RR-2345},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1994},\n  PDF = {https://hal.inria.fr/inria-00074332/file/RR-2345.pdf},\n  HAL_ID = {inria-00074332},\n  HAL_VERSION = {v1},\n}\n","title_s":["Axiomatisation d'un Lambda-Calcul avec Substitutions Explicites dans Coq"],"halId_s":"inria-00074332","uri_s":"https://hal.inria.fr/inria-00074332","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Amokrane Saibi"]},{"label_bibtex":"@techreport{mayero:inria-00072808,\n  TITLE = {{The Three Gap Theorem : Specification and Proof in Coq}},\n  AUTHOR = {Mayero, Micaela},\n  URL = {https://hal.inria.fr/inria-00072808},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RR-3848},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1999},\n  KEYWORDS = {THREE GAP THEOREM ; PROOF ; THEOREM ; SPECIFICATION ; COQ ; REAL NUMBERS},\n  PDF = {https://hal.inria.fr/inria-00072808/file/RR-3848.pdf},\n  HAL_ID = {inria-00072808},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Three Gap Theorem : Specification and Proof in Coq"],"halId_s":"inria-00072808","uri_s":"https://hal.inria.fr/inria-00072808","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Micaela Mayero"]},{"label_bibtex":"@techreport{gimenez:inria-00069950,\n  TITLE = {{A Tutorial on Recursive Types in Coq}},\n  AUTHOR = {Gim{\\'e}nez, Eduardo},\n  URL = {https://hal.inria.fr/inria-00069950},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RT-0221},\n  PAGES = {42},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1998},\n  MONTH = May,\n  KEYWORDS = {PROOF ENVIRONMENTS ; RECURSIVE TYPES},\n  PDF = {https://hal.inria.fr/inria-00069950/file/RT-0221.pdf},\n  HAL_ID = {inria-00069950},\n  HAL_VERSION = {v1},\n}\n","title_s":["A Tutorial on Recursive Types in Coq"],"halId_s":"inria-00069950","uri_s":"https://hal.inria.fr/inria-00069950","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Eduardo Giménez"]},{"label_bibtex":"@techreport{thery:inria-00072235,\n  TITLE = {{St{\\aa}lmarck's Algorithm in Coq: A Three-Level Approach}},\n  AUTHOR = {Th{\\'e}ry, Laurent},\n  URL = {https://hal.inria.fr/inria-00072235},\n  NUMBER = {RR-4353},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2002},\n  MONTH = Jan,\n  KEYWORDS = {COQ ; SATISFIABILITY ; ST{\\AA}LMARCK'S ALGORITHM ; BOOLEAN FORMULAE},\n  PDF = {https://hal.inria.fr/inria-00072235/file/RR-4353.pdf},\n  HAL_ID = {inria-00072235},\n  HAL_VERSION = {v1},\n}\n","title_s":["Stålmarck's Algorithm in Coq: A Three-Level Approach"],"halId_s":"inria-00072235","uri_s":"https://hal.inria.fr/inria-00072235","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Software and mathematics"],"authFullName_s":["Laurent Théry"]},{"label_bibtex":"@unpublished{bertot:inria-00001174,\n  TITLE = {{CoInduction in Coq}},\n  AUTHOR = {Bertot, Yves},\n  URL = {https://cel.archives-ouvertes.fr/inria-00001174},\n  NOTE = {Lecture},\n  TYPE = {DEA},\n  ADDRESS = {EU's coordination action Types Goteborg},\n  YEAR = {2005},\n  KEYWORDS = {Calculus of inductive constructions ; Coq ; Co-induction},\n  PDF = {https://cel.archives-ouvertes.fr/inria-00001174/file/co.pdf},\n  HAL_ID = {inria-00001174},\n  HAL_VERSION = {v1},\n}\n","title_s":["CoInduction in Coq"],"halId_s":"inria-00001174","uri_s":"https://cel.archives-ouvertes.fr/inria-00001174","submitType_s":"file","arxivId_s":"cs.LO/0603119","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Mathematical,  Reasoning and Software"],"authFullName_s":["Yves Bertot"]},{"label_bibtex":"@inproceedings{pottier:hal-01096354,\n  TITLE = {{Depth-First Search and Strong Connectivity in Coq}},\n  AUTHOR = {Pottier, Fran{\\c c}ois},\n  URL = {https://hal.inria.fr/hal-01096354},\n  BOOKTITLE = {{Vingt-sixi{\\`e}mes journ{\\'e}es francophones des langages applicatifs (JFLA 2015)}},\n  ADDRESS = {Le Val d'Ajol, France},\n  EDITOR = {David Baelde and Jade Alglave},\n  YEAR = {2015},\n  MONTH = Jan,\n  PDF = {https://hal.inria.fr/hal-01096354/file/jfla15_submission_2.pdf},\n  HAL_ID = {hal-01096354},\n  HAL_VERSION = {v1},\n}\n","title_s":["Depth-First Search and Strong Connectivity in Coq"],"halId_s":"hal-01096354","uri_s":"https://hal.inria.fr/hal-01096354","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Programming languages, types, compilation and proofs"],"authFullName_s":["François Pottier"]},{"label_bibtex":"@techreport{coq:inria-00069919,\n  TITLE = {{The Coq Proof Assistant : Reference Manual : Version 7.2}},\n  AUTHOR = {Coq, The},\n  URL = {https://hal.inria.fr/inria-00069919},\n  NUMBER = {RT-0255},\n  PAGES = {290},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2002},\n  MONTH = Feb,\n  KEYWORDS = {FORMAL PROOFS ; CALCULUS OF INDUCTIVE CONSTRUCTIONS ; COQ ; PROOF ASSISTANT},\n  PDF = {https://hal.inria.fr/inria-00069919/file/RT-0255.pdf},\n  HAL_ID = {inria-00069919},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Coq Proof Assistant : Reference Manual : Version 7.2"],"halId_s":"inria-00069919","uri_s":"https://hal.inria.fr/inria-00069919","submitType_s":"file","structName_s":["Université Paris-Sud - Paris 11","INRIA Saclay - Ile de France","Institut National de Recherche en Informatique et en Automatique","Polytechnique - X","Centre National de la Recherche Scientifique","Logic and computing"],"authFullName_s":["The Coq"]},{"label_bibtex":"@techreport{barras:inria-00073667,\n  TITLE = {{Coq en Coq}},\n  AUTHOR = {Barras, Bruno},\n  URL = {https://hal.inria.fr/inria-00073667},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RR-3026},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1996},\n  KEYWORDS = {PROGRAM EXTRACTION ; TYPE THEORY ; METATHEORY ; CALCULUS OF CONSTRUCTIONS},\n  PDF = {https://hal.inria.fr/inria-00073667/file/RR-3026.pdf},\n  HAL_ID = {inria-00073667},\n  HAL_VERSION = {v1},\n}\n","title_s":["Coq en Coq"],"halId_s":"inria-00073667","uri_s":"https://hal.inria.fr/inria-00073667","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Bruno Barras"]},{"label_bibtex":"@techreport{persson:inria-00072316,\n  TITLE = {{An Integrated Development of Buchberger's Algorithm in Coq}},\n  AUTHOR = {Persson, Henrik},\n  URL = {https://hal.inria.fr/inria-00072316},\n  NUMBER = {RR-4271},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2001},\n  MONTH = Sep,\n  KEYWORDS = {AGDA ; COQ ; INTEGRATED PROGRAMMING LOGIC ; BUCHBERGER'S ALGORITHM ; THEOREM PROVING ; COMPUTER ALGEBRA},\n  PDF = {https://hal.inria.fr/inria-00072316/file/RR-4271.pdf},\n  HAL_ID = {inria-00072316},\n  HAL_VERSION = {v1},\n}\n","title_s":["An Integrated Development of Buchberger's Algorithm in Coq"],"halId_s":"inria-00072316","uri_s":"https://hal.inria.fr/inria-00072316","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Software and mathematics"],"authFullName_s":["Henrik Persson"]},{"label_bibtex":"@techreport{dowek:inria-00070014,\n  TITLE = {{The Coq proof assistant user's guide : version 5.8}},\n  AUTHOR = {Dowek, Gilles and Felty, Amy and Herbelin, Hugo and Huet, G{\\'e}rard and Parent, Catherine and Paulin-Mohring, Christine and Werner, Benjamin and Murthy, Chetan},\n  URL = {https://hal.inria.fr/inria-00070014},\n  TYPE = {Research Report},\n  NUMBER = {RT-0154},\n  PAGES = {120},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1993},\n  PDF = {https://hal.inria.fr/inria-00070014/file/RT-0154.pdf},\n  HAL_ID = {inria-00070014},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Coq proof assistant user's guide : version 5.8"],"halId_s":"inria-00070014","uri_s":"https://hal.inria.fr/inria-00070014","submitType_s":"file","structName_s":["Institut National de Recherche en Informatique et en Automatique","INRIA Rocquencourt"],"authFullName_s":["Gilles Dowek","Amy Felty","Hugo Herbelin","Gérard Huet","Catherine Parent","Christine Paulin-Mohring","Benjamin Werner","Chetan Murthy"]},{"label_bibtex":"@techreport{dowek:inria-00070034,\n  TITLE = {{The Coq proof assistant user's guide : version 5.6}},\n  AUTHOR = {Dowek, Gilles and Felty, Amy and Herbelin, Hugo and Huet, G{\\'e}rard and Werner, Benjamin and Paulin-Mohring, Christine},\n  URL = {https://hal.inria.fr/inria-00070034},\n  TYPE = {Research Report},\n  NUMBER = {RT-0134},\n  PAGES = {155},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1991},\n  PDF = {https://hal.inria.fr/inria-00070034/file/RT-0134.pdf},\n  HAL_ID = {inria-00070034},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Coq proof assistant user's guide : version 5.6"],"halId_s":"inria-00070034","uri_s":"https://hal.inria.fr/inria-00070034","submitType_s":"file","structName_s":["Institut National de Recherche en Informatique et en Automatique","INRIA Rocquencourt"],"authFullName_s":["Gilles Dowek","Amy Felty","Hugo Herbelin","Gérard Huet","Benjamin Werner","Christine Paulin-Mohring"]},{"label_bibtex":"@techreport{huet:inria-00069993,\n  TITLE = {{The Coq Proof Assistant, A Tutorial, Version 5.10}},\n  AUTHOR = {Huet, G{\\'e}rard and Kahn, Gilles and Paulin-Mohring, Christine},\n  URL = {https://hal.inria.fr/inria-00069993},\n  NOTE = {Projet COQ},\n  NUMBER = {RT-0178},\n  PAGES = {46},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1995},\n  MONTH = Jul,\n  PDF = {https://hal.inria.fr/inria-00069993/file/RT-0178.pdf},\n  HAL_ID = {inria-00069993},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Coq Proof Assistant, A Tutorial, Version 5.10"],"halId_s":"inria-00069993","uri_s":"https://hal.inria.fr/inria-00069993","submitType_s":"file","structName_s":["Institut National de Recherche en Informatique et en Automatique","INRIA Rocquencourt"],"authFullName_s":["Gérard Huet","Gilles Kahn","Christine Paulin-Mohring"]},{"label_bibtex":"@techreport{kaplanterrasse:inria-00072540,\n  TITLE = {{Vers la certification du compilateur v5 d'Esterel dans Coq}},\n  AUTHOR = {Kaplan-Terrasse, Delphine},\n  URL = {https://hal.inria.fr/inria-00072540},\n  NUMBER = {RR-4092},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2000},\n  MONTH = Dec,\n  KEYWORDS = {PREUVES FORMELLES ; COQ ; SPECIFICATION DE CIRCUITS ; CERTIFICATION DE COMPILATEUR ; LANGAGES PARALLELES SYNCHRONES ; ESTEREL V5},\n  PDF = {https://hal.inria.fr/inria-00072540/file/RR-4092.pdf},\n  HAL_ID = {inria-00072540},\n  HAL_VERSION = {v1},\n}\n","title_s":["Vers la certification du compilateur v5 d'Esterel dans Coq"],"halId_s":"inria-00072540","uri_s":"https://hal.inria.fr/inria-00072540","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","MINES ParisTech - École nationale supérieure des mines de Paris","Theory and Practice of Synchronous Reactive Systems"],"authFullName_s":["Delphine Kaplan-Terrasse"]},{"label_bibtex":"@techreport{gonthier:inria-00407778,\n  TITLE = {{An Ssreflect Tutorial}},\n  AUTHOR = {Gonthier, Georges and St{\\'e}phane Le, Roux},\n  URL = {https://hal.inria.fr/inria-00407778},\n  TYPE = {Technical Report},\n  NUMBER = {RT-0367},\n  PAGES = {33},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2009},\n  KEYWORDS = {proof assistants ; formal proofs ; Coq ; small scale reflection ; tactics},\n  PDF = {https://hal.inria.fr/inria-00407778/file/RT-367.pdf},\n  HAL_ID = {inria-00407778},\n  HAL_VERSION = {v1},\n}\n","title_s":["An Ssreflect Tutorial"],"halId_s":"inria-00407778","uri_s":"https://hal.inria.fr/inria-00407778","submitType_s":"file","structName_s":["Microsoft Research","Microsoft Research [Cambridge]","Institut National de Recherche en Informatique et en Automatique","Microsoft","Microsoft Research Laboratory Cambridge","Microsoft Research - Inria Joint Centre"],"authFullName_s":["Georges Gonthier","Roux Stéphane Le"]},{"label_bibtex":"@techreport{huet:inria-00075051,\n  TITLE = {{The Gilbreath trick : a case study in axiomatisation and proof development in the Coq proof assistant}},\n  AUTHOR = {Huet, G{\\'e}rard},\n  URL = {https://hal.inria.fr/inria-00075051},\n  NOTE = {Projet FORMEL},\n  TYPE = {Research Report},\n  NUMBER = {RR-1511},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1991},\n  PDF = {https://hal.inria.fr/inria-00075051/file/RR-1511.pdf},\n  HAL_ID = {inria-00075051},\n  HAL_VERSION = {v1},\n}\n","title_s":["The Gilbreath trick : a case study in axiomatisation and proof development in the Coq proof assistant"],"halId_s":"inria-00075051","uri_s":"https://hal.inria.fr/inria-00075051","submitType_s":"file","structName_s":["Institut National de Recherche en Informatique et en Automatique","FORMEL"],"authFullName_s":["Gérard Huet"]},{"label_bibtex":"@techreport{bertot:inria-00069961,\n  TITLE = {{User Guide to the CTCOQ Proof Environment}},\n  AUTHOR = {Bertot, Janet and Bertot, Yves and Coscoy, Yann and Goguen, Healfdene and Montagnac, Francis},\n  URL = {https://hal.inria.fr/inria-00069961},\n  TYPE = {Technical Report},\n  NUMBER = {RT-0210},\n  PAGES = {63},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1997},\n  KEYWORDS = {CTCOQ ; COQ ; INTERACTIVE PROOF SYSTEMS},\n  PDF = {https://hal.inria.fr/inria-00069961/file/RT-0210.pdf},\n  HAL_ID = {inria-00069961},\n  HAL_VERSION = {v1},\n}\n","title_s":["User Guide to the CTCOQ Proof Environment"],"halId_s":"inria-00069961","uri_s":"https://hal.inria.fr/inria-00069961","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Design and Implementation of Programming Tools","University of Edinburgh","Laboratory for the Foundations of Computer Science [Edinburgh]"],"authFullName_s":["Janet Bertot","Yves Bertot","Yann Coscoy","Healfdene Goguen","Francis Montagnac"]},{"label_bibtex":"@techreport{thery:inria-00070394,\n  TITLE = {{Simplifying Polynomial Expressions in a Proof Assistant}},\n  AUTHOR = {Th{\\'e}ry, Laurent},\n  URL = {https://hal.inria.fr/inria-00070394},\n  TYPE = {Research Report},\n  NUMBER = {RR-5614},\n  PAGES = {16},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2005},\n  KEYWORDS = {SIMPLIFICATION ; POLYNOMIAL EXPRESSION ; PROOF SYSTEM ; COQ},\n  PDF = {https://hal.inria.fr/inria-00070394/file/RR-5614.pdf},\n  HAL_ID = {inria-00070394},\n  HAL_VERSION = {v1},\n}\n","title_s":["Simplifying Polynomial Expressions in a Proof Assistant"],"halId_s":"inria-00070394","uri_s":"https://hal.inria.fr/inria-00070394","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Software and mathematics"],"authFullName_s":["Laurent Théry"]},{"label_bibtex":"@techreport{dowek:inria-00073782,\n  TITLE = {{A Type-Free Formalization of Mathematics where Proofs are Objects}},\n  AUTHOR = {Dowek, Gilles},\n  URL = {https://hal.inria.fr/inria-00073782},\n  NOTE = {Projet COQ},\n  TYPE = {Research Report},\n  NUMBER = {RR-2915},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1996},\n  KEYWORDS = {GODEL'S THEOREM ; TARSKI'S THEOREM ; FUNCTIONNAL INTERPRETATION OF PROOFS ; REFLECTION ; FORMALIZATION OF MATHEMATICS ; SET THEORY},\n  PDF = {https://hal.inria.fr/inria-00073782/file/RR-2915.pdf},\n  HAL_ID = {inria-00073782},\n  HAL_VERSION = {v1},\n}\n","title_s":["A Type-Free Formalization of Mathematics where Proofs are Objects"],"halId_s":"inria-00073782","uri_s":"https://hal.inria.fr/inria-00073782","submitType_s":"file","structName_s":["INRIA Paris-Rocquencourt","Institut National de Recherche en Informatique et en Automatique","Formal Specifications and Program Validation"],"authFullName_s":["Gilles Dowek"]},{"label_bibtex":"@techreport{razet:inria-00257352,\n  TITLE = {{Simulating Eilenberg Machines with a Reactive Engine: Formal Specification, Proof and Program Extraction.}},\n  AUTHOR = {Razet, Benoit},\n  URL = {https://hal.inria.fr/inria-00257352},\n  TYPE = {Research Report},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2008},\n  PDF = {https://hal.inria.fr/inria-00257352/file/spec_fem.pdf},\n  HAL_ID = {inria-00257352},\n  HAL_VERSION = {v2},\n}\n","title_s":["Simulating Eilenberg Machines with a Reactive Engine: Formal Specification, Proof and Program Extraction."],"halId_s":"inria-00257352","uri_s":"https://hal.inria.fr/inria-00257352v2","submitType_s":"file","structName_s":["Institut National de Recherche en Informatique et en Automatique","Université d'Hyderabad","SANSKRIT"],"authFullName_s":["Benoit Razet"]},{"label_bibtex":"@techreport{thery:inria-00073414,\n  TITLE = {{Proving and Computing: a Certified Version of the Buchberger's Algorithm}},\n  AUTHOR = {Th{\\'e}ry, Laurent},\n  URL = {https://hal.inria.fr/inria-00073414},\n  NUMBER = {RR-3275},\n  INSTITUTION = {{INRIA}},\n  YEAR = {1997},\n  MONTH = Oct,\n  KEYWORDS = {COQ ; THEOREM PROVING ; COMPUTER ALGEBRA ; BUCHBERGER'S ALGORITHM},\n  PDF = {https://hal.inria.fr/inria-00073414/file/RR-3275.pdf},\n  HAL_ID = {inria-00073414},\n  HAL_VERSION = {v1},\n}\n","title_s":["Proving and Computing: a Certified Version of the Buchberger's Algorithm"],"halId_s":"inria-00073414","uri_s":"https://hal.inria.fr/inria-00073414","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Design and Implementation of Programming Tools"],"authFullName_s":["Laurent Théry"]},{"label_bibtex":"@techreport{guilhot:inria-00071689,\n  TITLE = {{Premiers pas vers un cours de g{\\'e}om{\\'e}trie en Coq pour le lyc{\\'e}e}},\n  AUTHOR = {Guilhot, Fr{\\'e}d{\\'e}rique},\n  URL = {https://hal.inria.fr/inria-00071689},\n  NUMBER = {RR-4893},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2003},\n  MONTH = Jul,\n  KEYWORDS = {ASSISTANT {\\`A} LA PREUVE ; INTERFACE GRAPHIQUE ; COQ ; ENSEIGNEMENT ; PREUVE ; G{\\'E}OM{\\'E}TRIE},\n  PDF = {https://hal.inria.fr/inria-00071689/file/RR-4893.pdf},\n  HAL_ID = {inria-00071689},\n  HAL_VERSION = {v1},\n}\n","title_s":["Premiers pas vers un cours de géométrie en Coq pour le lycée"],"halId_s":"inria-00071689","uri_s":"https://hal.inria.fr/inria-00071689","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Software and mathematics"],"authFullName_s":["Frédérique Guilhot"]},{"label_bibtex":"@techreport{thery:inria-00071985,\n  TITLE = {{A Tour of Formal Verification with Coq:Knuth's Algorithm for Prime Numbers}},\n  AUTHOR = {Th{\\'e}ry, Laurent},\n  URL = {https://hal.inria.fr/inria-00071985},\n  NUMBER = {RR-4600},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2002},\n  MONTH = Oct,\n  KEYWORDS = {PROGRAM VERIFICATION ; COQ ; PRIME NUMBERS ; BERTRAND'S POSTULATE},\n  PDF = {https://hal.inria.fr/inria-00071985/file/RR-4600.pdf},\n  HAL_ID = {inria-00071985},\n  HAL_VERSION = {v1},\n}\n","title_s":["A Tour of Formal Verification with Coq:Knuth's Algorithm for Prime Numbers"],"halId_s":"inria-00071985","uri_s":"https://hal.inria.fr/inria-00071985","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Software and mathematics"],"authFullName_s":["Laurent Théry"]},{"label_bibtex":"@techreport{chicli:inria-00072403,\n  TITLE = {{une formalisation des faisceaux et des sch{\\'e}mas affines en th{\\'e}orie des types avec Coq}},\n  AUTHOR = {Chicli, Laurent},\n  URL = {https://hal.inria.fr/inria-00072403},\n  NUMBER = {RR-4216},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2001},\n  MONTH = Jun,\n  KEYWORDS = {THEORIE DES TYPES ; TOPOLOGIE ; SCHEMAS ; FAISCEAUX ; FORMALISATION DES MATHEMATIQUES ; ALGEBRE ; COQ ; CTCOQ},\n  PDF = {https://hal.inria.fr/inria-00072403/file/RR-4216.pdf},\n  HAL_ID = {inria-00072403},\n  HAL_VERSION = {v1},\n}\n","title_s":["une formalisation des faisceaux et des schémas affines en théorie des types avec Coq"],"halId_s":"inria-00072403","uri_s":"https://hal.inria.fr/inria-00072403","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Software and mathematics"],"authFullName_s":["Laurent Chicli"]},{"label_bibtex":"@techreport{bertot:inria-00072591,\n  TITLE = {{A Coq Formalization of a Type Checker for Object Initialization in the Java Virtual Machine}},\n  AUTHOR = {Bertot, Yves},\n  URL = {https://hal.inria.fr/inria-00072591},\n  TYPE = {Research Report},\n  NUMBER = {RR-4047},\n  PAGES = {53},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2000},\n  KEYWORDS = {JAVA ; BYTE-CODE ; PROGRAMMING LANGUAGE SEMANTICS ; COQ ; AUTOMATIC DEMONSTRATION},\n  PDF = {https://hal.inria.fr/inria-00072591/file/RR-4047.pdf},\n  HAL_ID = {inria-00072591},\n  HAL_VERSION = {v1},\n}\n","title_s":["A Coq Formalization of a Type Checker for Object Initialization in the Java Virtual Machine"],"halId_s":"inria-00072591","uri_s":"https://hal.inria.fr/inria-00072591","submitType_s":"file","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Software and mathematics"],"authFullName_s":["Yves Bertot"]},{"label_bibtex":"@techreport{thery:inria-00113750,\n  TITLE = {{Formalising Sylow's theorems in Coq}},\n  AUTHOR = {Thery, Laurent and Rideau, Laurence},\n  URL = {https://hal.inria.fr/inria-00113750},\n  TYPE = {Technical Report},\n  NUMBER = {RT-0327},\n  PAGES = {23},\n  INSTITUTION = {{INRIA}},\n  YEAR = {2006},\n  KEYWORDS = {Group theory ; Sylow's theorems ; Formalisation of mathematics},\n  PDF = {https://hal.inria.fr/inria-00113750/file/RT-0327.pdf},\n  HAL_ID = {inria-00113750},\n  HAL_VERSION = {v2},\n}\n","title_s":["Formalising Sylow's theorems in Coq"],"halId_s":"inria-00113750","uri_s":"https://hal.inria.fr/inria-00113750v2","submitType_s":"file","arxivId_s":"cs.LO/0611057","structName_s":["Inria Sophia Antipolis - Méditerranée","Institut National de Recherche en Informatique et en Automatique","Mathematical,  Reasoning and Software"],"authFullName_s":["Laurent Thery","Laurence Rideau"]}]}}
