An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
☆36Nov 30, 2022Updated 3 years ago
Alternatives and similar repositories for Isabelle-HoTT
Users that are interested in Isabelle-HoTT are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A best-first-search theorem prover implemented in Isabelle☆37Jul 18, 2022Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Solutions of the exercises of the HoTT book☆23Dec 15, 2016Updated 9 years ago
- Formalism and proofs for esverify☆20May 26, 2018Updated 8 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Nov 10, 2021Updated 4 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- NbE course @ Chalmers☆28Sep 24, 2024Updated 2 years ago
- ☆16Feb 18, 2025Updated last year
- A collection of useful tips/tricks/hints for Isabelle users.☆17May 2, 2024Updated 2 years ago
- Lean4 library for substitution inspired by autosubst☆16Oct 23, 2026Updated last week
- IsarMathLib is a library of formalized mathematics for Isabelle/ZF.☆20Oct 24, 2026Updated last week
- Compiler for the Albatross Language☆12Sep 29, 2021Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆37Jun 10, 2025Updated last year
- ☆14Aug 5, 2026Updated 2 months ago
- being a programming language for sequential circuits☆26Oct 6, 2026Updated 3 weeks ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ☆29Oct 13, 2026Updated 3 weeks ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 8 years ago
- My solutions to exercises in "Concrete Semantics" (Tobias Nipkow, Gerwin Klein) These are for 2014-2015 version of the book.☆25Jun 17, 2015Updated 11 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 5 years ago
- A small NuPRL style proof assistant☆32Jan 31, 2019Updated 7 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- VERified asSembler for cryptographic primitives☆12Jul 15, 2023Updated 3 years ago
- A vim-emulator for jEdit 5☆15Apr 4, 2023Updated 3 years ago
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 7 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Minimalistic dependent type theory with syntactic metaprogramming☆61Jun 18, 2024Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆138Jun 5, 2024Updated 2 years ago
- Work based on http://www-sop.inria.fr/marelle/GeometricAlgebra/☆12Jul 8, 2025Updated last year
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆25Mar 3, 2026Updated 8 months ago
- Idris, but it's C☆24May 25, 2018Updated 8 years ago
- Fully proved small C functions (examples for verification course).☆17Jun 26, 2017Updated 9 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆397Oct 23, 2023Updated 3 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆18Mar 11, 2024Updated 2 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Dec 22, 2018Updated 7 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆16Jul 10, 2019Updated 7 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 5 years ago
- ☆22Jan 29, 2021Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆37Dec 21, 2019Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆18Jan 5, 2015Updated 11 years ago
- A simple λProlog interpreter☆21Nov 29, 2021Updated 4 years ago