edemaine / mathcestorLinks
Ancestor/descendant tree from Mathematics Genealogy Project, rendered to HTML
☆17Updated last year
Alternatives and similar repositories for mathcestor
Users that are interested in mathcestor are comparing it to the libraries listed below
Sorting:
- Metamath verifier in Python☆40Updated 3 months ago
- My unofficial picat http://picat-lang.org/ repository☆29Updated last year
- McLulang: The message is the language☆11Updated last year
- Pull your compiler up with abstract bootstraps.☆31Updated 2 years ago
- The rule-based graph programming language GP 2☆68Updated last year
- Leibniz - a Digital Scientific Notation☆36Updated 5 months ago
- ☆24Updated 2 years ago
- ☆14Updated last year
- Experimental, recursively-embeddable, domain-specific editors and text editor☆80Updated last year
- Integration of Sandblocks with Tree-Sitter to load block-based languages from grammars☆14Updated last year
- GATlab: a computer algebra system based on generalized algebraic theories (GATs)☆31Updated last month
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆34Updated 4 months ago
- A toy Wolfram language interpreter.☆35Updated 10 months ago
- An Impractical Stack Language☆14Updated 5 years ago
- A logic programming language that has features of both Datalog and answer set programming.☆117Updated last week
- Accompanying materials for "A Core Calculus for Documents"☆33Updated last year
- Julia package for learning cellular sheaf Laplacians☆16Updated 4 years ago
- BQN implementation in Julia☆17Updated 3 years ago
- Javascript implementation of Fractran☆14Updated 8 years ago
- A partial formalization of Geometric Algebra in the Lean formal proof verification system.☆53Updated last year
- 🦠 AD in less than 20 lines☆54Updated 4 years ago
- An experimental Agda kernel for Jupyter☆24Updated 3 years ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆65Updated 3 years ago
- A collection of lambda calculus interpreters and development tools☆16Updated 2 years ago
- This is an implementation of interaction nets, with a familiar JavaScript-like syntax :)☆56Updated 2 months ago
- Here we give programs that check if Turing machines halt or not.☆12Updated 3 weeks ago
- ☆24Updated 3 weeks ago
- Reversible programming in Agda☆12Updated 2 years ago
- This project is about formally verifying Seymour's decomposition theorem for regular matroids.☆35Updated 2 weeks ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 3 months ago