Kruskal-Finite
Finite type checker
Tools for proving properties about finite types and predicates using proof assistants
Tools for dealing with finiteness and choice
0 stars
2 watching
0 forks
Language: Coq
last commit: 3 months ago Related projects:
| Repository | Description | Stars |
|---|---|---|
| dmxlarchey/coq-kruskal | A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts. | 0 |
| dmxlarchey/kruskal-theorems | A library that provides formal proofs of tree theorems using inductive type theory. | 1 |
| dmxlarchey/kruskal-almostfull | A Coq library that formalizes ground results about Almost Full relations in constructive mathematics | 1 |
| 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/kruskal-trees | Formalizes rose trees in Coq with implementations of induction principles and manipulation tools | 1 |
| dmxlarchey/kruskal-higman | Provides detailed proofs and tools for Higman's theorem on unary trees | 0 |
 piotrmurach/finite_machine | A minimalist Ruby gem for defining and managing finite state machines with straightforward syntax and powerful callback mechanisms. | 808 |
 mmaelicke/dtype-decorate | A library of decorators to enforce data type constraints on function attributes | 0 |
| dmxlarchey/kruskal-veldman | A detailed proof of Wim Veldman's tree theorem adaptation in Coq | 0 |
| dmxlarchey/quasi-morphisms | A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations | 1 |
 lexi-lambda/higher-rank | A Haskell implementation of type checking and evaluation for higher-rank polymorphism | 101 |
 dyrkin/fsm | An implementation of a Finite State Machine in Go. | 62 |
 fluidex/plonkit | Provides tools and utilities for generating and verifying proofs in a zkSNARK proof system | 158 |
 typedefs/typedefs | A language-agnostic way to define algebraic data types using polynomials. | 366 |
| dmxlarchey/relevant-decidability | Mechanization of a proof for the decidability of Implicational Relevance Logic | 0 |