liamoc / holbertLinks
A graphical interactive proof assistant designed for education
☆169Updated 11 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☆129Updated 2 months ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆117Updated last week
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆114Updated this week
- A sudoku game where you have to prove that your deductions are valid☆116Updated 3 years ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆180Updated 4 years ago
- A simple raytracer written in Lean 4☆141Updated last year
- Companion files for Logical Verification 2020–2021 at VU Amsterdam☆96Updated 4 years ago
- Selected Papers of Dana S. Scott☆165Updated last year
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆248Updated 2 months ago
- A compiler for functional programs on serialized data☆172Updated last week
- The adventures of a Haskell compiler☆232Updated this week
- The Principia Rewrite☆227Updated 8 months ago
- Hitchhiker's Guide to Logical Verification (2023 Edition)☆112Updated last year
- The Makam Metalanguage☆199Updated 2 years ago
- Functional teaching language for use in a discrete mathematics course☆170Updated 4 months ago
- Day 9 of Advent of Haskell - Denotational Design☆98Updated 3 years ago
- ☆63Updated 3 years ago
- Dependent type checker using normalisation by evaluation☆269Updated last year
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated 3 months ago
- A categorical programming language with effects☆284Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- Effective Algebraic Topology in Haskell☆90Updated last year
- A pure type system implemented in OCaml☆77Updated 4 years ago
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆224Updated last year
- Spartan type theory☆271Updated last month
- ☆165Updated 5 years ago
- Implementation of the λΠ-calculus modulo rewriting☆217Updated last month