adamyedidia / parsimonyView external linksLinks
☆347Apr 19, 2018Updated 7 years ago
Alternatives and similar repositories for parsimony
Users that are interested in parsimony are comparing it to the libraries listed below
Sorting:
- metamath proof enumerators and other things☆93Nov 16, 2025Updated 2 months ago
- sorear's Metamath system engine - version 3 Rust☆25May 31, 2023Updated 2 years ago
- Automatically exported from code.google.com/p/ghilbert☆47Sep 28, 2017Updated 8 years ago
- Methods for accelerating and proving theorems about 5-state Busy Beaver candidates☆20Oct 29, 2021Updated 4 years ago
- Efficient, high-level dynamic programming☆28Jul 19, 2023Updated 2 years ago
- Busy Beaver deciders backed by Coq proof☆61Mar 2, 2025Updated 11 months ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- An implementation of derivative parsing in the parser combinator framework☆59Dec 2, 2010Updated 15 years ago
- A formal proof of the independence of the continuum hypothesis☆142Aug 26, 2024Updated last year
- ☆27Feb 3, 2026Updated last week
- [Mirror] A close reading of the μKanren paper.☆43Jun 14, 2022Updated 3 years ago
- Fractran interpreter in Fractran☆36Dec 27, 2014Updated 11 years ago
- ☆64Sep 13, 2022Updated 3 years ago
- ☆358Sep 20, 2025Updated 4 months ago
- Tools for finding Busy Beaver Turing Machines and Proving others as non-halting☆49Jan 23, 2026Updated 3 weeks ago
- A Henkin-style completeness proof for the modal logic S5☆17Jun 20, 2021Updated 4 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 4 months ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆42May 7, 2025Updated 9 months ago
- A place to put our 2018 Xena project UROP thoughts and programs.☆26May 27, 2020Updated 5 years ago
- Selected Papers of Dana S. Scott☆171Jun 20, 2024Updated last year
- Metamath Zero specification language☆375Updated this week
- Algorithmic Information Theory, using Binary Lambda Calculus☆197Feb 5, 2026Updated last week
- Goldbach conjecture = 25-state turing machine☆36Jan 13, 2025Updated last year
- Calculates the uncomputable Busy Beaver Σ-function☆11May 23, 2016Updated 9 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Sep 29, 2022Updated 3 years ago
- A formalization of M-types in Agda☆36Mar 7, 2020Updated 5 years ago
- A small language to demo turning an interpreter into a compiler☆11Nov 3, 2016Updated 9 years ago
- Verified decision procedures for modal logics in Lean☆12Jun 13, 2020Updated 5 years ago
- An automated approach to the Collatz conjecture☆12Oct 7, 2023Updated 2 years ago
- Small programs with unknown halting status.☆12Jun 7, 2016Updated 9 years ago
- A Small Combinator-Reduction System☆19Jul 14, 2020Updated 5 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Feb 14, 2021Updated 5 years ago
- HoTT in Lean 3☆81Aug 3, 2020Updated 5 years ago
- Generate Haskell code from a type☆146Feb 21, 2025Updated 11 months ago
- The Incredible Proof Machine☆386Dec 7, 2025Updated 2 months ago
- Globular☆39Aug 22, 2018Updated 7 years ago
- Sin, cos, tan, asin... polyfills for when cross browser consistency is desired.☆16Aug 6, 2021Updated 4 years ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆139Nov 29, 2025Updated 2 months ago
- A library of mechanised undecidability proofs in the Coq proof assistant.☆131Jan 2, 2026Updated last month