rzk-lang / sHoTT
Formalisations for simplicial HoTT and synthetic ∞-categories.
☆48Updated 6 months ago
Alternatives and similar repositories for sHoTT:
Users that are interested in sHoTT are comparing it to the libraries listed below
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆61Updated 5 months ago
- Ground Zero: Lean 4 HoTT Library☆57Updated 4 months ago
- HoTT in Lean 3☆79Updated 4 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆23Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- Simple theorem prover for the tope layer of Riehl and Shulman type theory with shapes.☆17Updated 2 years ago
- H.O.T.T. using rewriting in Agda☆41Updated 2 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆58Updated this week
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- A Testing Framework for Lean☆52Updated this week
- A Lean 4 library for configuring Command Line Interfaces and parsing command line arguments.☆75Updated last week
- high-performance cubical evaluation☆71Updated 4 months ago
- ☆30Updated last month
- A blueprint for a formalization of infinity-cosmos theory in Lean.☆58Updated last week
- Schemes in Lean (v2)☆43Updated 4 years ago
- ☆36Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago
- Lean 4 formalization of Rubik's cubes☆29Updated last month
- Lean type-checker written in Scala.☆35Updated 3 years ago
- Topos theory in lean☆59Updated 4 years ago
- ☆29Updated last year
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- Reference sheet for people who know Lean 3 and want to write tactic-based proofs in Lean 4☆27Updated 5 months ago
- Parser Combinator Library for Lean 4☆47Updated last week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆27Updated 2 years ago
- A toy example of a verified compiler.☆28Updated 2 weeks ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Experiments with SAT solvers with proofs in Lean 4☆56Updated 9 months ago
- Lecture notes on realizability☆72Updated last month