liamoc / holbertLinks
A graphical interactive proof assistant designed for education
☆169Updated 9 months ago
Alternatives and similar repositories for holbert
Users that are interested in holbert are comparing it to the libraries listed below
Sorting:
- The cuteness implementation of a dependently typed language.☆193Updated 2 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆130Updated this week
- A sudoku game where you have to prove that your deductions are valid☆116Updated 2 years ago
- An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax☆111Updated last month
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆178Updated 4 years ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆114Updated this week
- A compiler for functional programs on serialized data☆166Updated 2 months ago
- Companion files for Logical Verification 2020–2021 at VU Amsterdam☆96Updated 4 years ago
- The adventures of a Haskell compiler☆230Updated 3 months ago
- Selected Papers of Dana S. Scott☆162Updated last year
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- The Makam Metalanguage☆199Updated 2 years ago
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆247Updated last week
- Hash-based Diffing for AST's☆77Updated 5 years ago
- A simple raytracer written in Lean 4☆139Updated last year
- Staged compilation with dependent types☆179Updated 3 months ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- Demo for dependent types + runtime code generation☆70Updated 6 months ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- The Next Generation of Compositional Programming☆52Updated last week
- A categorical programming language with effects☆283Updated 2 years ago
- Effective Algebraic Topology in Haskell☆91Updated 11 months ago
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated last month
- Implementation of the λΠ-calculus modulo rewriting☆214Updated 3 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆75Updated 8 years ago
- Alexander Grothendieck's 1972 talk at CERN, on scientific research☆63Updated 10 months ago
- My personal repository of formally verified mathematics.