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
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆116Updated this week
- 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 sudoku game where you have to prove that your deductions are valid☆117Updated 3 years ago
- Companion files for Logical Verification 2020–2021 at VU Amsterdam☆96Updated 4 years ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆180Updated 4 years ago
- Selected Papers of Dana S. Scott☆168Updated last year
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆117Updated this week
- A simple raytracer written in Lean 4☆142Updated last year
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆252Updated last week
- Alexander Grothendieck's 1972 talk at CERN, on scientific research☆65Updated last year
- The Makam Metalanguage☆200Updated 2 years ago
- A compiler for functional programs on serialized data☆172Updated this week
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Effective Algebraic Topology in Haskell☆90Updated last year
- Hitchhiker's Guide to Logical Verification (2023 Edition)☆112Updated last year
- Day 9 of Advent of Haskell - Denotational Design☆98Updated 3 years ago
- Spartan type theory☆271Updated 2 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- ☆64Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆120Updated 5 months 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☆183Updated 6 months ago
- The Principia Rewrite☆228Updated 9 months ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Library of the ##dependent distributed research support group☆117Updated last year
- Bologna Optimal Higher-Order Machine, Version 1.1☆81Updated 8 years ago
- Type-checker for the λΠ-calculus modulo rewriting☆217Updated this week
- ☆89Updated 4 years ago
- The adventures of a Haskell compiler☆232Updated 2 weeks ago