A graphical interactive proof assistant designed for education
☆170Nov 21, 2024Updated last year
Alternatives and similar repositories for holbert
Users that are interested in holbert are comparing it to the libraries listed below
Sorting:
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Sep 23, 2025Updated 5 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Aug 1, 2014Updated 11 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Dec 2, 2025Updated 3 months ago
- Efficient Haskell effect handlers based on evidence translation.☆86Jul 19, 2021Updated 4 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- ☆17Feb 20, 2024Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated last month
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Normalization by Evaluation for Embedded Domain-specific Languages☆31Oct 31, 2024Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- A dependent type theory with user defined data types☆47Oct 1, 2021Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- Anders: Cubical Type Checker☆23Oct 23, 2023Updated 2 years ago
- Organize mathematical thoughts☆20Oct 6, 2023Updated 2 years ago
- A stack-driven generator of arbitrary WebAssembly programs☆19Sep 5, 2021Updated 4 years ago
- The Ott tool for writing definitions of programming languages and calculi☆404Feb 15, 2026Updated 2 weeks ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- An experiment towards a UI programming model inspired by algebraic effects.☆30May 15, 2017Updated 8 years ago
- ☆17Apr 4, 2024Updated last year
- Flexible Haskell library for parsing and printing S-Expressions☆21Oct 30, 2024Updated last year
- Complexity analysis in Lean☆10Feb 5, 2024Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 3 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- A mini language for logic programming☆23Jun 5, 2020Updated 5 years ago
- an implementation of stuck macros☆152Dec 24, 2025Updated 2 months ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago