rzk-lang / sHoTTLinks
Formalisations for simplicial HoTT and synthetic ∞-categories.
☆51Updated last month
Alternatives and similar repositories for sHoTT
Users that are interested in sHoTT are comparing it to the libraries listed below
Sorting:
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆67Updated 9 months ago
- Simple theorem prover for the tope layer of Riehl and Shulman type theory with shapes.☆17Updated 2 years ago
- Ground Zero: Lean 4 HoTT Library☆64Updated 2 weeks ago
- HoTT in Lean 3☆80Updated 4 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- high-performance cubical evaluation☆74Updated 3 months ago
- ☆36Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 10 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- H.O.T.T. using rewriting in Agda☆43Updated 2 years ago
- Schemes in Lean (v2)☆43Updated 5 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆37Updated 3 weeks ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- High level commands to declare a hierarchy based on packed classes☆100Updated last week
- A formalization of the theory behind the mugen library☆19Updated last year
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆61Updated last week
- HoTT Book formalisations in Rzk.☆20Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Lecture notes on realizability☆74Updated 5 months ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- A Seamless, Interactive Tactic Learner and Prover for Coq☆74Updated this week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago