ionathanch / TTBFLLinks
A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
☆22Updated 8 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☆15Updated 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☆55Updated 4 months ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- Algebraic proof discovery in Agda☆35Updated 4 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 4 years ago
- Mechanizations of Type Theories☆32Updated this week
- my phd thesis☆26Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆36Updated last month
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Experimental implementation of a Cubical Type Theory modeled by presheaves over posets☆12Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- ☆17Updated last year
- ☆38Updated 4 years ago
- Extensions to cubical for categorical logic/type theory☆35Updated this week
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 2 months ago
- antifunext☆38Updated last year
- Work in progress on semi-simplicial types☆23Updated 3 years ago
- Quasi-quoting library for agda☆18Updated last year
- Agda to C compiler☆10Updated 3 months ago
- ☆21Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago