benediktahrens / CT4P
☆34Updated 6 months ago
Alternatives and similar repositories for CT4P:
Users that are interested in CT4P are comparing it to the libraries listed below
- 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 work-in-progress core language for Agda, in Agda☆51Updated 3 weeks ago
- Lecture notes on realizability☆72Updated 2 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- Paper and talk☆54Updated last year
- A (formalised) general definition of type theories☆57Updated 3 years ago
- An experimental category theory library for Lean☆50Updated last year
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- A digital archive of category theory papers.☆30Updated last year
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆63Updated 6 months ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- The Agda Universal Algebra Library (html docs available at the url below)☆33Updated 5 months ago
- ☆15Updated 10 months ago
- ☆36Updated 3 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆49Updated 7 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Mechanizations of Type Theories☆28Updated 2 months ago
- A cost-aware logical framework, embedded in Agda.☆61Updated this week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- ☆83Updated 2 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- ☆29Updated 2 years ago
- Topos theory in lean☆59Updated 4 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Partial combinatory algebras and realizability interpretations of arithmetic, in Coq.☆13Updated 8 years ago
- ☆29Updated 2 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last month
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago