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: 6 months ago Related projects:
| Repository | Description | Stars |
|---|---|---|
| dmxlarchey/kruskal-almostfull | A Coq library that formalizes ground results about Almost Full relations in constructive mathematics | 1 |
| dmxlarchey/coq-kruskal | A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts. | 0 |
 vafeiadis/hahn | A collection of lemmas and tactics about lists and binary relations for a proof assistant | 30 |
| dmxlarchey/kruskal-trees | Formalizes rose trees in Coq with implementations of induction principles and manipulation tools | 1 |
| dmxlarchey/friedman-tree | A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding. | 0 |
| dmxlarchey/kruskal-finite | Tools for proving properties about finite types and predicates using proof assistants | 0 |
 coq-community/atbr | A Coq library providing algebraic tools and tactics for working with binary relations | 23 |
| dmxlarchey/kruskal-fan | A Coq implementation of the Fan theorem and König's lemma for proving properties about monotone relations on lists and finite fans. | 1 |
| dmxlarchey/relevant-decidability | Mechanization of a proof for the decidability of Implicational Relevance Logic | 0 |
| dmxlarchey/kruskal-veldman | A detailed proof of Wim Veldman's tree theorem adaptation in Coq | 0 |
 charguer/tlc | A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |
 sjsyrek/maryamyriameliamurphies.js | A Haskell-style library of morphisms in ES2015 JavaScript for functional programming and monads | 181 |
| coq-community/topology | Develops and formalizes basic concepts and results of general topology in Coq. | 47 |
| dmxlarchey/kruskal-theorems | A library that provides formal proofs of tree theorems using inductive type theory. | 1 |
| coq-community/coqeal | A Coq library providing algebraic data structures and algorithms | 66 |