MevenBertrand / NbEReadingGroupLinks
A repository for material from the reading group on NbE
☆17Updated last year
Alternatives and similar repositories for NbEReadingGroup
Users that are interested in NbEReadingGroup are comparing it to the libraries listed below
Sorting:
- Mechanizations of Type Theories☆29Updated 3 months ago
- ☆29Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- Research material of Erik Palmgren (1963–2019)☆20Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 8 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A bottom-up approach to a verified implementation of MLTT☆20Updated this week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- A work-in-progress core language for Agda, in Agda☆52Updated last month
- BibTeX bibliographies for proof engineering-related papers☆30Updated 5 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 7 months ago
- Meta-programming utilities for Agda.☆19Updated 3 weeks ago
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- ☆17Updated 2 years ago
- antifunext☆33Updated 11 months ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- ☆25Updated 9 months ago
- ☆21Updated 3 years ago
- We aim to provide a composed build of all active Coq developments in existence☆12Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆13Updated last year
- Partial combinatory algebras and realizability interpretations of arithmetic, in Coq.☆13Updated 8 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 5 months ago
- Logical Relation for MLTT in Coq☆25Updated last week
- H.O.T.T. using rewriting in Agda☆42Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆45Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- 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
- ☆47Updated this week