Kruskal-Finite
by DmxLarchey
Tools for dealing with finiteness and choice
AI summary
Data analysis tools
Tools for determining and working with finite data structures in a proof assistant.
- stars
- 0
- forks
- 0
- watching
- 2
Similar projects
Found by comparing what the projects do, not just their names.
Kruskal proof library
A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts.
Tree embedding theorems
Provides theorem results for tree embeddings in inductive type theory
Almost Full relation library
A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma.
Proof framework
A Coq proof framework for Fan theorem and König's lemma
Rose tree library
A Coq library formalizing rose trees for mathematical proof and theorem proving
Tree embedding library
An inductive proof of Higman's theorem for unary trees and lists, providing a constructive basis for Kruskal's theorem
Finite machine library
A minimalist Ruby gem for defining and managing finite state machines with straightforward syntax and powerful callback mechanisms.
Data type checkers
A library of decorators to enforce data type constraints on function attributes
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.
Quasi morphism library
A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations
Type checker
A Haskell implementation of type checking and evaluation for higher-rank polymorphism
FSM
An implementation of a Finite State Machine in Go.
Proof verifier
Provides tools and utilities for generating and verifying proofs in a zkSNARK proof system
Type constructor
A language-agnostic way to define algebraic data types using polynomials.
Relevance logic proof
Mechanization of a proof for the decidability of Implicational Relevance Logic
