ionathanch / TTBFLLinks
A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
☆19Updated last month
Alternatives and similar repositories for TTBFL
Users that are interested in TTBFL are comparing it to the libraries listed below
Sorting:
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆13Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Notes (and implementation) of unification with binders☆14Updated last month
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- ☆19Updated 3 years ago
- ☆23Updated 11 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- my phd thesis☆26Updated 10 months ago
- ☆29Updated 2 years ago
- Agda to C compiler☆10Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- Mechanizations of Type Theories☆30Updated this week
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆13Updated 2 months ago
- ☆11Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 months ago
- ☆29Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- NbE course @ Chalmers☆28Updated 9 months ago