rzk-lang / hottbookLinks
HoTT Book formalisations in Rzk.
☆19Updated 2 years ago
Alternatives and similar repositories for hottbook
Users that are interested in hottbook are comparing it to the libraries listed below
Sorting:
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- ☆17Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- Distributions of Agda executable compiled into WebAssembly.☆24Updated last month
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Interactive holes for Lean 4☆22Updated last year
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- ☆22Updated 2 years ago
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 2 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- Extensions to cubical for categorical logic/type theory☆35Updated this week
- ☆21Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Organize mathematical thoughts☆20Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- PL syntax macros.☆21Updated last month
- ☆33Updated 6 months ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆72Updated last year
- ☆16Updated 3 years ago