Pinned Repositories
abstract-machines
Implementations in OCaml of various abstract machines
cic-model
Set-theoretical models of various type theories (up to an extensional version of the Calculus of Inductive Constructions), aiming at proving logical consistency and strong normalization
coq
Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
Dedukti
Implementation of the λΠ-calculus modulo rewriting
europroofnet.github.io
Sources of the EuroProofNet web site.
Foundations
Development of the univalent foundations of mathematics in Coq
HoTT
Homotopy type theory
lambdapi
Minimal implementation of the λΠ-calculus modulo
ocaml-bindlib
Efficient binder representation in OCaml
resystance
Rewrite system stats n' count
barras's Repositories
barras/abstract-machines
Implementations in OCaml of various abstract machines
barras/cic-model
Set-theoretical models of various type theories (up to an extensional version of the Calculus of Inductive Constructions), aiming at proving logical consistency and strong normalization
barras/coq
Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
barras/Dedukti
Implementation of the λΠ-calculus modulo rewriting
barras/europroofnet.github.io
Sources of the EuroProofNet web site.
barras/Foundations
Development of the univalent foundations of mathematics in Coq
barras/HoTT
Homotopy type theory
barras/lambdapi
Minimal implementation of the λΠ-calculus modulo
barras/ocaml-bindlib
Efficient binder representation in OCaml
barras/resystance
Rewrite system stats n' count