Quasi-Morphisms
Quasi morphism library
A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations
Quasi morphisms for Almost Full relations
1 stars
2 watching
0 forks
Language: Coq
last commit: 3 months ago Related projects:
Repository | Description | Stars |
---|---|---|
| A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma. | 1 |
| A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts. | 0 |
| A collection of lemmas and tactics about lists and binary relations for a proof assistant | 30 |
| A Coq library formalizing rose trees for mathematical proof and theorem proving | 1 |
| A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding. | 0 |
| Tools for determining and working with finite data structures in a proof assistant. | 0 |
| A Coq library providing algebraic tools and tactics for working with binary relations | 23 |
| A Coq proof framework for Fan theorem and König's lemma | 1 |
| Mechanization of a proof for the decidability of Implicational Relevance Logic | 0 |
| Provides a constructive account of Wim Veldman's proof of a variant of Kruskal's tree theorem for rose trees in Coq. | 0 |
| A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |
| A Haskell-style library of morphisms in ES2015 JavaScript for functional programming and monads | 182 |
| Develops and formalizes basic concepts and results of general topology in Coq. | 47 |
| Provides theorem results for tree embeddings in inductive type theory | 1 |
| A Coq library providing algebraic data structures and algorithms | 67 |