liamoc / holbertLinks
A graphical interactive proof assistant designed for education
☆171Updated 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
- Companion files for Logical Verification 2020–2021 at VU Amsterdam☆96Updated 5 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆132Updated 5 months ago
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆124Updated last week
- Selected Papers of Dana S. Scott☆171Updated last year
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆180Updated 4 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 last month
- The Makam Metalanguage☆199Updated 2 years ago
- A compiler for functional programs on serialized data☆174Updated this week
- Agda lecture notes for the Functional Programming course at TU Delft☆132Updated 6 months ago
- A simple raytracer written in Lean 4☆143Updated last year
- My personal repository of formally verified mathematics.☆310Updated 2 weeks ago
- Lecture notes on univalent foundations of mathematics with Agda☆232Updated last month
- The adventures of a Haskell compiler☆237Updated 3 months ago
- Day 9 of Advent of Haskell - Denotational Design☆98Updated 4 years ago
- A categorical programming language with effects☆291Updated 2 years ago
- Type-checker for the λΠ-calculus modulo rewriting☆225Updated 2 months ago
- Spartan type theory☆273Updated 4 months ago
- Forge: A Tool and Language for Teaching Formal Methods☆95Updated this week
- The Principia Rewrite☆229Updated 2 months ago
- Staged compilation with dependent types☆187Updated this week
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆262Updated this week
- Benchmarks for capture-avoiding substitution☆122Updated 8 months ago
- Dependent type checker using normalisation by evaluation☆273Updated last year
- Library of the ##dependent distributed research support group☆119Updated last year
- Effective Algebraic Topology in Haskell☆90Updated last year
- Alexander Grothendieck's 1972 talk at CERN, on scientific research☆67Updated last year
- ☆64Updated 3 years ago
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆228Updated 2 years ago