Mathematical Components
Mathematical Components is a repository of formalized mathematics developed using
the Coq proof assistant. This project finds its roots in the formal proof of
the Four Color Theorem. It has been used for large scale formalization projects,
including a formal proof of the Odd Order (Feit-Thompson) Theorem.
Here are 53 public repositories matching this topic...
Lecture notes for a short course on proving/programming in Coq via SSReflect.
-
Updated
Jun 24, 2021 - Coq
Distributed Separation Logic: a framework for compositional verification of distributed protocols and their implementations in Coq
-
Updated
Jul 26, 2024 - Coq
Monadic effects and equational reasonig in Coq
-
Updated
Oct 25, 2024 - Coq
The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
-
Updated
Aug 19, 2024 - Coq
A Coq formalization of information theory and linear error-correcting codes
-
Updated
Oct 25, 2024 - Coq
A course on formal verification at https://compsciclub.ru/en, Spring term 2021
-
Updated
Feb 28, 2023 - HTML
-
Updated
Sep 17, 2024 - Coq
Finite sets, finite maps, multisets and generic sets
-
Updated
May 29, 2024 - Coq
Functional Algorithms Verified in SSReflect [maintainer=@clayrat]
-
Updated
Sep 20, 2024 - Coq
-
Updated
Jul 22, 2024 - Coq
Graph Theory [maintainers=@chdoc,@damien-pous]
-
Updated
Jul 16, 2024 - Coq
Ring, field, lra, nra, and psatz tactics for Mathematical Components
-
Updated
Sep 11, 2024 - Coq
Finite sets and maps for Coq with extensional equality
-
Updated
Oct 11, 2023 - Coq
A proof of Abel-Ruffini theorem.
-
Updated
Aug 19, 2024 - Coq
Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]
-
Updated
Aug 11, 2024 - Coq
Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]
-
Updated
Jan 20, 2022 - Coq
Created by Georges Gonthier
Released 2008
Latest release 10 months ago
- Followers
- 31 followers
- Repository
- math-comp/math-comp
- Website
- math-comp.github.io