liamoc / holbertLinks
A graphical interactive proof assistant designed for education
☆169Updated last year
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 3 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆130Updated 4 months ago
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆118Updated last month
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆180Updated 4 years ago
- Companion files for Logical Verification 2020–2021 at VU Amsterdam☆96Updated 5 years ago
- A sudoku game where you have to prove that your deductions are valid☆117Updated 3 years ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆121Updated 2 weeks ago
- Selected Papers of Dana S. Scott☆170Updated last year
- A simple raytracer written in Lean 4☆143Updated last year
- Alexander Grothendieck's 1972 talk at CERN, on scientific research☆66Updated last year
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆253Updated last month
- The Makam Metalanguage☆198Updated 2 years ago
- The Principia Rewrite☆229Updated 3 weeks ago
- A compiler for functional programs on serialized data☆173Updated this week
- My personal repository of formally verified mathematics.☆308Updated this week
- Agda lecture notes for the Functional Programming course at TU Delft☆131Updated 5 months ago
- ☆64Updated 3 years ago
- Type-checker for the λΠ-calculus modulo rewriting☆223Updated 3 weeks ago
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago
- Hitchhiker's Guide to Logical Verification (2023 Edition)☆113Updated 2 years ago
- ☆165Updated 6 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- Staged compilation with dependent types☆186Updated 7 months ago
- Dependent type checker using normalisation by evaluation☆269Updated last year
- being an operating system for typechecking processes☆130Updated 2 months ago
- Lecture notes on univalent foundations of mathematics with Agda☆232Updated last month
- The adventures of a Haskell compiler☆234Updated 2 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Spartan type theory☆271Updated 3 months ago