fizruk / simple-topesLinks
Simple theorem prover for the tope layer of Riehl and Shulman type theory with shapes.
☆17Updated 2 years ago
Alternatives and similar repositories for simple-topes
Users that are interested in simple-topes are comparing it to the libraries listed below
Sorting:
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 3 weeks ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆66Updated 9 months ago
- ☆29Updated 2 years ago
- ☆29Updated 3 years ago
- Ground Zero: Lean 4 HoTT Library☆63Updated 2 weeks ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- A repository for material from the reading group on NbE☆17Updated last year
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Paper and talk☆54Updated 2 years ago
- HoTT in Lean 3☆80Updated 4 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- ☆48Updated last month
- A formalization of the theory behind the mugen library☆19Updated last year
- Lean4 port of Arduino balance car controller☆44Updated 4 years ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- ☆12Updated 4 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- 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
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆16Updated 2 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- Lecture notes on realizability☆74Updated 4 months ago
- H.O.T.T. using rewriting in Agda☆43Updated 2 years ago
- A toy example of a verified compiler.☆28Updated 2 months ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 6 months ago