ionathanch / TTBFL
A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
☆9Updated last week
Alternatives and similar repositories for TTBFL:
Users that are interested in TTBFL are comparing it to the libraries listed below
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Agda to C compiler☆10Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Notes (and implementation) of unification with binders☆14Updated 3 weeks ago
- ☆18Updated 3 years ago
- my phd thesis☆26Updated 8 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- ☆11Updated 4 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆12Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- ☆16Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Verified NbE via gluing in Agda☆11Updated 11 months ago
- ☆14Updated 10 months ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 4 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- A formalization of the theory behind the mugen library☆19Updated 9 months ago
- Lecture notes and exercises for the advanced course on categorical realizability at the Midlands Graduate School (MGS) 2024☆18Updated 2 months ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆15Updated last year
- ☆36Updated 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