CMU-HoTT / serre-finitenessLinks
☆23Updated last month
Alternatives and similar repositories for serre-finiteness
Users that are interested in serre-finiteness are comparing it to the libraries listed below
Sorting:
- Research material of Erik Palmgren (1963–2019)☆21Updated 8 months ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- Organize mathematical thoughts☆20Updated 2 years ago
- ☆15Updated 2 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- my phd thesis☆26Updated last year
- Mechanizations of Type Theories☆32Updated this week
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- ☆14Updated 3 months ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆32Updated 4 years ago
- antifunext☆34Updated last year
- Extensions to cubical for categorical logic/type theory☆34Updated this week
- ☆17Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Updated 6 months ago
- ☆11Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- ☆14Updated last year
- Coherence typechecker for infinity categories☆20Updated last week
- ☆45Updated 8 months ago
- ☆21Updated 3 years ago
- A formalized proof of a version of the initiality conjecture☆44Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆29Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- ☆30Updated 2 years ago
- ☆25Updated last year