andrejbauer / notes-on-realizabilityLinks
Lecture notes on realizability
☆74Updated 6 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:
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- high-performance cubical evaluation☆75Updated 3 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆62Updated this week
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- A tutorial on how Agda infers things☆60Updated last month
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆67Updated 10 months ago
- Ground Zero: Lean 4 HoTT Library☆64Updated this week
- Eventually a practical 2-level TT-based compiler☆27Updated 3 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆61Updated 11 months ago
- ☆36Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- antifunext☆34Updated last year
- 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
- ☆48Updated last week
- CS410 "Advanced Functional Programming"☆25Updated 3 months ago
- HoTT in Lean 3☆80Updated 5 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Mechanizations of Type Theories☆32Updated 2 weeks ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 2 weeks ago
- A formalized proof of a version of the initiality conjecture☆43Updated 4 years ago
- A toy example of a verified compiler.☆29Updated 4 months ago
- ☆24Updated last week
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago