ionathanch / TTBFL
A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
☆19Updated 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
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆52Updated 7 months ago
- Mechanizations of Type Theories☆28Updated 2 months ago
- Notes (and implementation) of unification with binders☆14Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 2 weeks ago
- ☆19Updated 3 years ago
- my phd thesis☆26Updated 9 months ago
- ☆29Updated 2 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆13Updated 2 weeks ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆23Updated 10 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆13Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆27Updated last week
- Experiments with Realizability in Univalent Type Theory☆18Updated 6 months ago
- Agda to C compiler☆10Updated last year
- ☆36Updated 3 years ago
- ☆29Updated 2 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- ☆15Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 2 months ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 5 months ago