andrejbauer / notes-on-realizability
Lecture notes on realizability
☆72Updated 2 months ago
Alternatives and similar repositories for notes-on-realizability
Users that are interested in notes-on-realizability are comparing it to the libraries listed below
Sorting:
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆60Updated this week
- A work-in-progress core language for Agda, in Agda☆52Updated 3 weeks ago
- high-performance cubical evaluation☆72Updated 2 weeks ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 2 years ago
- Ground Zero: Lean 4 HoTT Library☆60Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆53Updated 8 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 7 months ago
- ☆36Updated 3 years ago
- High level commands to declare a hierarchy based on packed classes☆99Updated this week
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- antifunext☆33Updated 10 months ago
- ☆24Updated 11 months ago
- HoTT in Lean 3☆80Updated 4 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆123Updated 3 years ago
- A (formalised) general definition of type theories☆57Updated 3 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
- Benchmarks for capture-avoiding substitution☆113Updated last week
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 7 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆66Updated last year
- Datatypes as quotients of polynomial functors☆35Updated 5 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- ☆25Updated 8 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month