Quasi-Morphisms
by DmxLarchey
Quasi morphisms for Almost Full relations
AI summary
Quasi morphism library
A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations
- stars
- 1
- forks
- 0
- watching
- 2
Similar projects
Found by comparing what the projects do, not just their names.
Almost Full relation library
A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma.
Kruskal proof library
A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts.
Relation algebra library
A collection of lemmas and tactics about lists and binary relations for a proof assistant
Rose tree library
A Coq library formalizing rose trees for mathematical proof and theorem proving
Tree function
A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding.
Data analysis tools
Tools for determining and working with finite data structures in a proof assistant.
Relation Algebra Library
A Coq library providing algebraic tools and tactics for working with binary relations
Proof framework
A Coq proof framework for Fan theorem and König's lemma
Relevance logic proof
Mechanization of a proof for the decidability of Implicational Relevance Logic
Tree theorem proof
Provides a constructive account of Wim Veldman's proof of a variant of Kruskal's tree theorem for rose trees in Coq.
Coq math library
A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems.
Morphism library
A Haskell-style library of morphisms in ES2015 JavaScript for functional programming and monads
Topology library
Develops and formalizes basic concepts and results of general topology in Coq.
Tree embedding theorems
Provides theorem results for tree embeddings in inductive type theory
Algebra library
A Coq library providing algebraic data structures and algorithms
