An axiom-free formalization of category theory in Coq for personal study and practical work
- category-theory
- coq
- monad
- profunctor
47,133 repositories indexed
1–24 of 26 · Most stars
An axiom-free formalization of category theory in Coq for personal study and practical work
Formal proof of the Four Color Theorem [maintainer=@ybertot]
A function definition package for Rocq
A formalization of geometry in Coq based on Tarski's axiom system
A Verified Compiler for Gallina, Written in Gallina
A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]
A library of mechanised undecidability proofs in the Coq proof assistant.
A library of Coq definitions, theorems, and tactics. [maintainers=@gmalecha,@liyishuai]
Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]
A Rocq formalization of information theory and linear error-correcting codes
The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
The Waterproof plugin for the Rocq proof assistant allows you to write Rocq proofs in a style that resembles handwritten mathematical proofs, designed to help university students with learning how to prove mathematical statements.
Finite sets, finite maps, multisets and generic sets
Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]
Graph Theory [maintainers=@chdoc,@damien-pous]
Coq library on rewriting theory and termination
The formal proof of the Odd Order Theorem
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]
Stable sort algorithms and their stability proofs in Rocq
Coq library of arbitrarily large numbers, providing BigN, BigZ, BigQ that used to be part of the standard library [maintainers=@proux01,@erikmd]
A Coq library providing tactics to deal with hypothesis
A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.
Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components and SSReflect [maintainers=@CohenCyril,@palmskog]