doctorn / agda-nbeLinks
Verified NbE via gluing in Agda
☆11Updated last year
Alternatives and similar repositories for agda-nbe
Users that are interested in agda-nbe are comparing it to the libraries listed below
Sorting:
- Agda to C compiler☆10Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆15Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- ☆11Updated 4 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆13Updated last year
- ☆19Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆30Updated last week
- my phd thesis☆26Updated 9 months ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 7 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- ☆12Updated 5 years ago
- ☆17Updated 2 years ago
- ☆29Updated 2 years ago
- ☆23Updated 11 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆16Updated 3 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- An agda2hs-compatible library for well-scoped syntax☆11Updated last week
- Lecture notes and exercises for the advanced course on categorical realizability at the Midlands Graduate School (MGS) 2024☆19Updated 3 months ago
- Mtac in Agda☆28Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago