Dominique Larchey-Wendling's repositories
Coq-Phase-Semantics
Coq Source for Relational Phase Semantics and Cut-elimination
Introduction-to-Coq
Introduction to the Coq proof assistant
The-Braga-Method
The Braga Method for Extracting Certified OCaml from Coq code
Accessibility
A small course on the inductive accessibility predicate in Coq
Tree-mirror
Tree mirroring specified in a small fun. language and Coq proofs of correctedness
Breadth-First-Numbering
Coq implementation of Breadth-First Numbering à la Okasaki
Coq-Kruskal
Description of the Coq-Kruskal project with a map and pointers
coq-library-undecidability
A library of formalised undecidable problems in Coq
Friedman-TREE
Construction of Friedman's tree(n) and TREE(n) in Coq
Karp-Miller
A Coq mechanization of the Karp-Miller algorithm based on Kruskal-AlmostFull
Kruskal-AlmostFull
Library of basic results about Almost Full relations in Coq
Kruskal-Fan
The Fan theorem for inductive bars and a constructive variant of König's lemma
Kruskal-Finite
Tools for dealing with finiteness and choice
Kruskal-Higman
Detailed proof of Higman's lemma for unary trees and lists
Kruskal-Theorems
Kruskal and Higman type tree theorems for the Kruskal-AlmostFull library
Kruskal-Trees
Coq library for rose trees
Kruskal-Veldman
An adaptation of Wim Veldman's proof of the tree theorem to Coq
Murec_Extraction
Extraction of µ-recursive algorithms in Coq
opam-coq-archive
Archive for all Coq related OPAM packages organized in various repositories
opam-repository
Main public package repository for opam, the source package manager of OCaml.
PHP-short
A short Coq proof of the PHP
Quasi-Morphisms
Quasi morphisms for Almost Full relations
Relevant-decidability
A constructive account of Kripke-Curry's decidability proof for Implicational Relevance logic (see README.md below)
SQRT2
The square root of 2 is not rational
wf-strict-order-finite
Direct proof that strict orders on listable types are well-founded