andrejbauer / notes-on-realizabilityLinks
Lecture notes on realizability
☆75Updated 10 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:
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated 3 weeks ago
- A work-in-progress core language for Agda, in Agda☆61Updated last week
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆68Updated 3 weeks ago
- antifunext☆38Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- high-performance cubical evaluation☆77Updated 8 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 5 months ago
- Mechanizations of Type Theories☆32Updated this week
- A tutorial on how Agda infers things☆63Updated 6 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆72Updated last year
- ☆31Updated 2 years ago
- ☆25Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Updated last year
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- ☆38Updated 4 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- EPIT 2020 - Spring School on Homotopy Type Theory☆110Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆29Updated this week
- Selected Papers of Dana S. Scott☆170Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- ☆25Updated 4 months ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- High level commands to declare a hierarchy based on packed classes☆104Updated last week
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- A cost-aware logical framework, embedded in Agda.☆70Updated 2 months ago