ionathanch / TTBFLLinks
A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
☆22Updated 4 months ago
Alternatives and similar repositories for TTBFL
Users that are interested in TTBFL are comparing it to the libraries listed below
Sorting:
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated this week
- Mechanizations of Type Theories☆32Updated last month
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter