Mathematical Components
-
Updated
Feb 4, 2026 - Rocq Prover
Mathematical Components
Lecture notes for a short course on proving/programming in Coq via SSReflect.
Distributed Separation Logic: a framework for compositional verification of distributed protocols and their implementations in Coq
Monadic effects and equational reasoning in Rocq
A Rocq formalization of information theory and linear error-correcting codes
A course on formal verification at https://compsciclub.ru/en, Spring term 2021
Finite sets, finite maps, multisets and generic sets
Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]
Ring, field, lra, nra, and psatz tactics for Mathematical Components
The formal proof of the Odd Order Theorem
Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]
A proof of Abel-Ruffini theorem.
Finite sets and maps for Coq with extensional equality
Micromega tactics for Mathematical Components
Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]
Stable sort algorithms and their stability proofs in Rocq
Add a description, image, and links to the ssreflect topic page so that developers can more easily learn about it.
To associate your repository with the ssreflect topic, visit your repo's landing page and select "manage topics."