andrejbauer / notes-on-realizabilityLinks
Lecture notes on realizability
☆74Updated 4 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☆63Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- A work-in-progress core language for Agda, in Agda☆53Updated last month
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Mechanizations of Type Theories☆30Updated last week
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- A tutorial on how Agda infers things☆58Updated this week
- antifunext☆34Updated last year
- high-performance cubical evaluation☆74Updated 2 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆66Updated 8 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- ☆25Updated 10 months ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated 3 months ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆61Updated 2 weeks ago
- ☆29Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆63Updated this week
- A TACtic library for Agda☆48Updated 10 months ago
- ☆24Updated last year
- Paper and talk☆54Updated 2 years ago
- ☆48Updated last month
- Building A Correct-By-Construction Proof Checkers For Type Theories☆21Updated last week
- Effective Algebraic Topology in Haskell☆91Updated 10 months ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- ☆36Updated 3 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago