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.
TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.
- tla
- specifications
- model-checking
- verification
Plan, apply and roll back changes to a production ontology, with a blast radius report and a proof an auditor can re-check.
- ai-native
- description-logics
- knowledge-graph
- mcp
Creusot helps you prove your Rust code is correct.
A Coq library for Homotopy Type Theory
- type-theory
- homotopy-type-theory
- univalent-foundations
cvc5 is an open-source automatic theorem prover for Satisfiability Modulo Theories (SMT) problems.
This rocq library aims to formalize a substantial body of mathematics using the univalent point of view.
Mathematical Components
- coq
- ssreflect
- mathcomp
- coq-formalization
NASA PVS Library of Formal Developments
A TLA+ interpreter and model checker in TypeScript
formally verified category theory library
Formal proof of the Four Color Theorem [maintainer=@ybertot]
- coq
- ssreflect
- mathcomp
- four-color-theorem
CoqHammer: An Automated Reasoning Hammer Tool for Rocq - Proof Automation for Dependent Type Theory
A formalization of geometry in Coq based on Tarski's axiom system
A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]
A Lean formalization of the Classification of Finite Simple Groups
A Lean formalization of the Stacks Project
Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]
- coq-library
- real-number
- coq
- coq-ci
Variations on Kirby & Paris' hydra battles and other entertaining math in Coq (collaborative, documented, includes exercises) [maintainer=@Casteran]
- coq
- hydra-battles
- ordinal-notations
- formal-proofs
Prime numbers for Coq
- coq
- theorem-proving
- elliptic-curves
- prime-numbers
The formal proof of the Odd Order Theorem
- coq
- ssreflect
- mathcomp
- feit-thompson-theorem
Ring solver for Idris
Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components and SSReflect [maintainers=@CohenCyril,@palmskog]
- coq
- mathcomp
- ssreflect
- tarjan-algorithm
Extra contribution for mathcomp
- theorem-proving
- primality-test
- matroid
- rsa-algorithm