emilyriehl / yonedaLinks
comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories
☆71Updated last year
Alternatives and similar repositories for yoneda
Users that are interested in yoneda are comparing it to the libraries listed below
Sorting:
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆54Updated last month
- Lecture notes on realizability☆75Updated 10 months ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆67Updated last week
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- H.O.T.T. using rewriting in Agda☆46Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Ground Zero: Lean 4 HoTT Library☆74Updated 2 weeks ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated last week
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- high-performance cubical evaluation☆77Updated 8 months ago
- A work-in-progress core language for Agda, in Agda☆61Updated last week
- Effective Algebraic Topology in Haskell☆90Updated last year
- HoTT in Lean 3☆82Updated 5 years ago
- Mechanizations of Type Theories☆32Updated 2 weeks ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- antifunext☆37Updated last year
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆56Updated 3 years ago
- ☆36Updated 4 years ago
- ☆33Updated 6 months ago
- ♾️ A library for universe levels and universe polymorphism☆36Updated last month
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- maze game encoded in Lean 4 syntax☆66Updated 5 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last week
- ☆31Updated 2 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago