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:
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆130Updated 3 weeks ago
- The cuteness implementation of a dependently typed language.☆193Updated 2 years ago
- An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax☆112Updated last month
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆177Updated 4 years ago
- A sudoku game where you have to prove that your deductions are valid☆116Updated 3 years ago
- Companion files for Logical Verification 2020–2021 at VU Amsterdam☆96Updated 4 years ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆115Updated this week
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆247Updated 3 weeks ago
- A simple raytracer written in Lean 4☆140Updated last year
- Selected Papers of Dana S. Scott☆162Updated last year
- A compiler for functional programs on serialized data☆167Updated last week
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- The Principia Rewrite☆225Updated 7 months ago
- The Makam Metalanguage☆199Updated 2 years ago
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated last month
- Benchmarks for capture-avoiding substitution☆119Updated 3 months ago
- Implementation of the λΠ-calculus modulo rewriting☆213Updated 2 weeks ago
- Files associated with the course Interactive Theorem Proving at LMU SoSe 2024☆61Updated last year
- Effective Algebraic Topology in Haskell☆91Updated last year
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 2 months ago
- Day 9 of Advent of Haskell - Denotational Design☆98Updated 3 years ago
- Demo for dependent types + runtime code generation☆71Updated 6 months ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- Hitchhiker's Guide to Logical Verification (2023 Edition)☆111Updated last year
- Functional teaching language for use in a discrete mathematics course☆170Updated 2 months ago
- A formal logic framework that runs in the browser☆300Updated 8 months ago
- Alexander Grothendieck's 1972 talk at CERN, on scientific research☆64Updated 11 months ago
- Staged compilation with dependent types☆180Updated 4 months ago
- Dependent type checker using normalisation by evaluation☆265Updated last year