47,133 repositories indexed
1–21 of 21 · Most stars
The Rocq Prover is an interactive theorem prover, or proof assistant. 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.
This rocq library aims to formalize a substantial body of mathematics using the univalent point of view.
A port of Coq to Javascript -- Run Coq in your Browser
A Library for Representing Recursive and Impure Programs in Coq
Formal proof of the Four Color Theorem [maintainer=@ybertot]
A Coq specification of ECMAScript 5 (JavaScript) with verified reference interpreter
A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]
A library of Coq definitions, theorems, and tactics. [maintainers=@gmalecha,@liyishuai]
Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]
Variations on Kirby & Paris' hydra battles and other entertaining math in Coq (collaborative, documented, includes exercises) [maintainer=@Casteran]
The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
Statements of famous theorems proven in Coq [maintainer=@jmadiot]
Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]
Graph Theory [maintainers=@chdoc,@damien-pous]
VCFloat: A Unified Coq Framework for Verifying C Programs with Floating-Point Computations
Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]
Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]
A certified Sudoku solver in Coq [maintainers=@siraben,@thery]
Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components and SSReflect [maintainers=@CohenCyril,@palmskog]
Coqtail is a library of mathematical theorems and tools proved inside the Coq proof assistant. Results range mostly from arithmetic to real and complex analysis. [maintainer=@jmadiot]
Completeness and Decidability of Modal Logic Calculi [maintainer=@chdoc]