A curated list of awesome Coq libraries, plugins, tools, and resources.
The Coq proof assistant provides a formal language to write mathematical definitions, executable algorithms, and theorems, together with an environment for semi-interactive development of machine-checked proofs.
Contributions welcome! Read the contribution guidelines first.
Framework for smart contract testing and verification featuring a code extraction pipeline to several smart contract languages.
Framework to ease change of data representations in proofs.
Framework for proofs of cryptography.
Mostly automated synthesis of correct-by-construction programs.
Framework for modularly verifying programs with effects and effect handlers.
A shallow embedding of sequential separation logic formulated as a type theory.
System for reasoning using higher-order abstract syntax representations of object logics.
Higher-order concurrent separation logic framework.
Platform for implementing and verifying query compilers.
Framework for modular cryptographic proofs based on the Mathematical Components library.
Framework for verifying C programs with floating-point computations.
Framework for formally verifying distributed systems implementations.
Toolchain for verifying C code inside Coq in a higher-order concurrent, impredicative separation logic that is sound w.r.t. the Clight language of the CompCert compiler.
Standalone graphical tool for interacting with Coq.
Interface for Coq based on the Vim text editor.
Language server and extension for the Visual Studio Code and VSCodium editors with custom document checking engine.
Generic interface for proof assistants based on the extensible, customizable text editor Emacs.
IDE extensions for Proof General's Coq mode.
IDE extension for Proof General to locally change or reset the opam switch from a menu or using a command.
Port of Coq to JavaScript, which enables running Coq projects in a browser.
Coq support for the Jupyter Notebook web environment.
Language server and extension for the Visual Studio Code and VSCodium editors.
Backwards-compatible extension for the Visual Studio Code and VSCodium editors using Coq's legacy XML protocol.
Educational environment for writing mathematical proofs in interactive notebooks.
Partial Rocq tree-sitter grammar useful for syntax highlighting in text editors like [Helix](https://github.com/helix-editor/helix), but not recommended for full parsing of Rocq code.
Library for reasoning on randomized algorithms.
Ring and field tactics for Mathematical Components.
Library of arbitrarily large numbers.
Library for reasoning on fixed precision machine words.
Library for reasoning about directed graphs and their embedding in separation logic.
Library on rewriting theory, lambda-calculus and termination, with sub-libraries on common data structures extending the Coq standard library.
Library smoothing the transition to Coq for Haskell users.
Collection of libraries related to rose trees and Kruskal's tree theorem.
Tactics for performing proofs of inequalities on expressions of real numbers.
Library which provides a generic way to update Coq record fields.
Extended alternative standard library for Coq.
Collection of theories and plugins that may be useful in other Coq developments.
Formalization of partial commutative monoids as used in verification of pointer-manipulating programs.
Formalization of floating-point numbers and computations.
Library of undecidable problems and reductions between them.
Library for reasoning on lists and binary relations.
Library for representing recursive and impure programs.
Library of Ltac tactics to manage and manipulate hypotheses in proofs.
Extra material for the Mathematical Components library, including the AKS primality test and RSA encryption and decryption.
Library enabling Micromega arithmetic solvers to work when using Mathematical Components number definitions.
Library for programming language metatheory using locally nameless variable binding representations.
Library for parameterized coinduction.
Translations between different definitions of regular languages, including regular expressions and automata.
Modular formalization of algebras with heterogeneous binary relations as models.
Input/output monad with user-definable primitive operations.
Non-constructive alternative to Coq's standard library.
Build tool distributed with Coq and based on generating a makefile.
Nix helper scripts to automate local builds and continuous integration for Coq.
Collection of Coq packages based on opam.
Curated collection of packages to support Coq use in industry, education, and research.
Templates for generating configuration files for Coq projects.
Coq-related packages available in the testing distribution of Debian.
Docker images for many versions of Coq.
Docker images for many combinations of versions of Coq and the Mathematical Components library.
GitHub container action that can be used with Docker-Coq or Docker-MathComp.
Composable and opinionated build system for OCaml and Coq (former jbuilder).
Package manager for Linux and other Unix systems, supporting atomic upgrades and rollbacks.
Collection of Coq-related packages for Nix.
Flexible and Git-friendly package manager for OCaml and Coq with multiple compiler support.
Tactics for rewriting universally quantified equations, modulo associativity and commutativity of some operator.
Plugin for doing proofs by enhanced coinduction.
Extension framework based on λProlog providing an extensive API to implement commands and tactics.
General-purpose automated reasoning hammer tool that combines learning from previous proofs with the translation of problems to automated provers and the reconstruction of found proofs.
Function definition package for Coq.
Tactic for discharging goals about floating-point arithmetic and round-off errors.
Collection of commands for declaring Coq hierarchies based on packed classes.
SMT-like tactics for combined propositional reasoning about function symbols, constructors, and arithmetic.
Experimental typed tactic language similar to Coq's classic Ltac language.
Project formalizing Coq in Coq and providing tools for manipulating Coq terms and developing certified plugins.
Plugin adding typed tactics for backward reasoning.
Plugin to generate parametricity translations of Coq terms.
Plugin for randomized property-based testing.
Tool that checks proof witnesses coming from external SAT and SMT solvers.
Interactive tool which learns from previously written tactic scripts across all the installed Coq packages and suggests the next tactic to be executed or tries to automate proof synthesis fully.
Plugin that replaces the existing unification algorithm with an enhanced one.
Plugin providing a language for writing proof scripts in a style that resembles non-mechanized mathematical proof.
Coq implementation of Sokoban, the Japanese warehouse keepers' game.
The Tower of Hanoi puzzle in Coq, including generalizations and theorems about configurations.
Coq formalization and solver of the 2x2x2 version of the Rubik's Cube puzzle.
Repository for submitting proven contenders for the title of biggest number in Coq.
Coq version of the natural number game developed for the Lean prover.
Formalization and solver of the Sudoku number-placement puzzle in Coq.
Coq version of the 2048 sliding tile game.
Collection of tools for writing technical documents that mix Coq code and prose.
Tool that generates Coq code for handling binders in syntax, such as for renaming and substitutions.
Tool for proving properties of OCaml programs in separation logic.
Alternative HTML documentation generator for Coq.
Standard documentation tool that generates LaTeX or HTML files from Coq code.
Tool for generating idiomatic Coq from OCaml code.
Tool for building dependency graphs between Coq objects.
Scripts for dealing with Coq files, including tabulating proof times.
Scripts for manipulating Coq developments.
Automated solver for reasoning about SQL query equivalences.
Converter from Haskell code to equivalent Coq code.
Tool for generating locally nameless Coq definitions and proofs.
Parser generator that can output Coq code for verified parsers.
Mutation analysis tool for Coq projects.
Tool for writing definitions of programming languages and calculi that can be translated to Coq.
Set of bindings and libraries for interacting with Coq from inside Python 3.
Fork of coq2html that adds indexes, clickable notations, Markdown and LaTeX formatting in comments, and more.
Tool for suggesting lemma names in Coq projects.
Tool for specifying instruction set architecture (ISA) semantics of processors and generating Coq definitions.
Tools and OCaml library for (de)serialization of Coq code to and from JSON and S-expressions.
Generic goal preprocessing tool for proof automation tactics.
find-bug.py - Automatically minimizes source files producing an error, creating small test cases for Coq bugs.
absolutize-imports.py - Processes source files to make loading of dependencies robust against shadowing of file names.inline-imports.py - Creates stand-alone source files from developments by inlining the loading of all dependencies.minimize-requires.py - Removes loading of unused dependencies.move-requires.py - Moves all dependency loading statements to the top of source files.move-vernaculars.py - Lifts many vernacular commands and inner lemmas out of proof script blocks.proof-using-helper.py - Modifies source files to include proof annotations for faster parallel proving.Library for classical real analysis compatible with Mathematical Components.
Axiom-free formalization of category theory.
Soundness, completeness, and decidability for the logics K, K*, CTL, and PDL.
Library for certifying primality using Pocklington and Elliptic Curve certificates.
Library of constructive real analysis and algebra.
Library of mathematical results ranging from arithmetic to real and complex analysis.
Formalization of classical real analysis compatible with the standard library and focusing on usability.
Extension of Mathematical Components with finite maps, sets, and multisets.
Formal proof of the Four Color Theorem, a landmark result of graph theory.
Implementation of books from Bourbaki's Elements of Mathematics, including set theory and number theory.
Formalization of geometry based on Tarski's axiom system.
Formalized graph theory results.
Development of homotopy-theoretic ideas.
Formalization of information theory and linear error-correcting codes.
Formalization of mathematical theories, focusing in particular on group theory.
Abstract interfaces for mathematical structures based on type classes.
Monadic effects and equational reasoning.
Formal proof of the Odd Order Theorem, a landmark result of finite group theory.
Proof of Puiseux's theorem and computation of roots of polynomials of Puiseux's series.
Library which aims to formalize a substantial body of mathematics using the univalent point of view.
High-assurance compiler for almost all of the C language (ISO C99), generating efficient code for the PowerPC, ARM, RISC-V and x86 processors.
Verified hash-based approximate membership structures such as Bloom filters.
Verified compiler from Gallina, the internal language of Coq, down to CompCert's Clight language.
Cryptographic primitive code generation.
Purely functional verified implementations of algorithms for searching, sorting, and other fundamental problems.
Verified OCaml implementation of an algorithm for incremental cycle detection in graphs.
Formalized language and verified compiler for high-assurance and high-speed cryptography.
Coq specification of ECMAScript 5 (JavaScript) with verified reference interpreter.
Formal model of a Rust core language and type system, a logical relation for the type system, and safety proofs for some Rust libraries.
Definitions and proofs for real-time system schedulability analysis.
Definition of the RISC-V processor instruction set architecture and extensions.
Generic and modular proofs of correctness, including stability, of mergesort functions.
Verified implementations of algorithms for topological sorting and finding strongly connected components in finite graphs.
Verified compiler for a Lustre/Scade-like dataflow synchronous language.
Implementation of the Raft distributed consensus protocol, verified in Coq using the Verdi framework.
Formalization in Coq of the WebAssembly (aka Wasm) 1.0 specification.
The first book dedicated to Coq.
Series of Coq-based textbooks on logic, functional programming, and foundations of programming languages, aimed at being accessible to beginners.
Textbook about practical engineering with Coq which teaches advanced practical tricks and a very specific style of proof.
Book that explains how to construct program logics using separation logic, accompanied by a formal model in Coq which is applied to the Clight programming language and other examples.
Book that simultaneously provides a general introduction to formal logical reasoning about the correctness of programs and to using Coq for this purpose.
Book that gives a brief and practically-oriented introduction to interactive proofs in Coq which emphasizes the computational nature of inductive reasoning about decidable propositions via a small set of primitives from the SSReflect proof language.
Book that describes how to formally specify and verify floating-point algorithms in Coq using the Flocq library.
Book oriented towards mathematically inclined users, focusing on the Mathematical Components library and the SSReflect proof language.
Book covering topics in computational logic using Coq, including foundations, canonical case studies, and practical programming.
Continuously in-progress book and library on Kirby and Paris' hydra battles and other entertaining formalized mathematics in Coq, including a proof of the Gödel-Rosser first incompleteness theorem.
Lecture notes on getting started with the Mathematical Components library and using it for classical reasoning and real analysis.
Introduction to using separation logic to reason about sequential imperative programs in Coq.
Introductory course on Coq real numbers and floating-point numbers from the Flocq library.
Formalization to support an undergraduate course on the theory of computation, including languages and Turing machines.
Material on the Software Foundations series of textbooks, including a series of YouTube videos.
Coq sources for lessons and exercises that introduce the SSReflect proof language and the Mathematical Components library.
Companion Coq sources for a course on programming language semantics at Collège de France.
Companion Coq sources for a course on program logics at Collège de France.
Lectures and exercise material for a course in programming language semantics, type systems and program logics, using Coq, at Radboud University Nijmegen.
Introduction to developing and verifying programs with Coq.
Coq code and exercises from the Coq'Art book, including additional tutorials.
Introduction to how Coq can be used to define logical concepts and functions and reason about them.
Guide on how to write readable and reviewable Coq code in high assurance applications.
Guide to Coq tactics with explanations and examples.
Whirlwind tour of Coq as a language.
Demonstration of design patterns for programming and proving with canonical structures.
Source code for Mathematical Components tutorials.
Basics of using Coq to write formal proofs.
Tips, tricks, and features in Coq that are hard to discover.