lemma-overloading
Proof automation library
A Coq library demonstrating design patterns for automated proof automation and canonical structures
Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]
26 stars
10 watching
6 forks
Language: Coq
last commit: 11 months ago
Linked from 2 awesome lists
automationcanonical-structurescoqmathcomppaper-artifactsssreflecttypeclasses
Related projects:
| Repository | Description | Stars |
|---|---|---|
| | Coq proof assistant book with exercises and examples | 114 |
| | Automates formalizing syntactic theories with variable binders in Coq | 52 |
| | A Coq library providing algebraic data structures and algorithms | 67 |
| | A comprehensive library of verified data structures and algorithms in Coq | 45 |
| | Provides definitions and verified translations between various representations of regular languages in the Coq proof assistant | 41 |
| | A library of abstract interfaces for various mathematical structures to facilitate algebraic manipulation and type class-based reasoning in Coq | 162 |
| | Develops and formalizes basic concepts and results of general topology in Coq. | 47 |
| | A Coq implementation of mathematical concepts from N. Bourbaki's Elements of Mathematics | 30 |
| | A collection of mathematical theorems and tools within the Coq proof assistant | 15 |
| | A multi-platform distribution of the Coq proof assistant and its libraries, providing a standardized setup for development and teaching | 191 |
| | A library for reasoning about randomized algorithms in Coq | 25 |
| | A Coq library providing algebraic tools and tactics for working with binary relations | 23 |
| | A formalization of bitset operations in Coq with extraction to OCaml native integers. | 22 |
| | Machine-checked proofs of soundness, completeness, and decidability for modal logics in Coq. | 8 |
| | A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |