ionathanch / TTBFLLinks
A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
☆19Updated 2 months ago
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
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- my phd thesis☆26Updated 11 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- Mechanizations of Type Theories☆30Updated last week
- Notes (and implementation) of unification with binders☆14Updated 2 months ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 8 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 7 months ago
- Quasi-quoting library for agda☆17Updated 7 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- antifunext☆34Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated last month
- Verified NbE via gluing in Agda☆11Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- A formalization of the theory behind the mugen library☆19Updated last year
- A style guide for Coq☆18Updated 3 years ago
- ☆36Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆21Updated last week
- 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
- ☆15Updated last year
- Agda to C compiler☆10Updated 2 years ago