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 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
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 8 months ago
- ☆19Updated 3 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆13Updated last year
- Agda to C compiler☆10Updated last year
- my phd thesis☆26Updated 9 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- ☆36Updated 3 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- ☆21Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Notes (and implementation) of unification with binders☆14Updated 3 weeks ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 8 months ago
- ☆29Updated 2 years ago
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆30Updated last week
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A formalization of the theory behind the mugen library☆19Updated 11 months 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
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- ☆23Updated 11 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated last week
- ☆25Updated 9 months ago
- ☆29Updated 2 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