hydra-battles
Math investigations
Investigating various aspects of discrete mathematics and formal proofs in Coq, including ordinal numbers and computability theory.
Variations on Kirby & Paris' hydra battles and other entertaining math in Coq (collaborative, documented, includes exercises) [maintainer=@Casteran]
69 stars
9 watching
12 forks
Language: Coq
last commit: over 2 years agoLinked from 2 awesome lists
coqcoq-nix-toolboxdiscrete-mathematicsdocker-coq-actionformal-proofshydra-battlesordinal-notationsprimitive-recursive-functions
uhub/awesome-coqRelated projects:
| Repository | Description | Stars |
|---|---|---|
| coq-community/gaia | A Coq implementation of mathematical concepts from N. Bourbaki's Elements of Mathematics | 30 |
| coq-community/dedekind-reals | A formalization of Dedekind reals numbers in the Coq programming language | 43 |
| coq-community/corn | A comprehensive formalization of mathematical structures and concepts for verified computation in Coq. | 111 |
| coq-community/math-classes | A library of abstract interfaces for various mathematical structures to facilitate algebraic manipulation and type class-based reasoning in Coq | 162 |
| coq-community/coqeal | A Coq library providing algebraic data structures and algorithms | 67 |
| coq-community/coqtail-math | A collection of mathematical theorems and tools within the Coq proof assistant | 15 |
| coq-community/graph-theory | Formalized graph theory results for research and verification | 35 |
 charguer/tlc | A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |
| coq-community/fav-ssr | A comprehensive library of verified data structures and algorithms in Coq | 45 |
| coq-community/sudoku | A formalisation of Sudoku in Coq to solve the puzzle using a naive Davis-Putnam procedure | 20 |
| coq-community/topology | Develops and formalizes basic concepts and results of general topology in Coq. | 47 |
| coq-community/atbr | A Coq library providing algebraic tools and tactics for working with binary relations | 23 |
| coq-community/tarjan | Formalization of Tarjan and Kosaraju's strongly connected component algorithm in Coq for finite graphs. | 13 |
| coq-community/lemma-overloading | A Coq library demonstrating design patterns for automated proof automation and canonical structures | 26 |
| coq-community/aac-tactics | Tactics for rewriting and proving equations with associativity and commutativity properties | 29 |