liamoc / holbertLinks
A graphical interactive proof assistant designed for education
☆167Updated 8 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 last year
- A sudoku game where you have to prove that your deductions are valid☆115Updated 2 years ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆178Updated 4 years ago
- A simple raytracer written in Lean 4☆140Updated last year
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆115Updated last week
- An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax☆110Updated 2 weeks ago
- A compiler for functional programs on serialized data☆165Updated last month
- Selected Papers of Dana S. Scott☆162Updated last year
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆244Updated 4 months ago
- Alexander Grothendieck's 1972 talk at CERN, on scientific research☆61Updated 9 months ago
- Companion files for Logical Verification 2020–2021 at VU Amsterdam☆96Updated 4 years ago
- Staged compilation with dependent types☆177Updated 2 months ago
- ☆64Updated 2 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Spartan type theory☆270Updated last year
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- My personal repository of formally verified mathematics.☆303Updated this week
- ☆90Updated 3 years ago
- Functional teaching language for use in a discrete mathematics course☆169Updated last month
- Dependent type checker using normalisation by evaluation☆263Updated 10 months ago
- The Principia Rewrite☆224Updated 6 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated 2 weeks ago
- Forge: A Tool and Language for Teaching Formal Methods☆82Updated 3 weeks ago
- Implementation of the λΠ-calculus modulo rewriting☆214Updated 3 months ago