ionathanch / TTBFLLinks
A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
☆22Updated 5 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
- ♾️ A library for universe levels and universe polymorphism☆35Updated last month
- 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 3 weeks ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated last week
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Mechanizations of Type Theories☆32Updated last month
- ☆36Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆39Updated 2 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Experimental implementation of a Cubical Type Theory modeled by presheaves over posets☆12Updated last year
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- ☆41Updated 3 weeks ago
- Experiments with Realizability in Univalent Type Theory☆19Updated 11 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Quasi-quoting library for agda☆18Updated 10 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- my phd thesis☆26Updated last year
- ☆21Updated 3 years ago
- ☆25Updated last year
- 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
- ☆17Updated last year
- ☆15Updated 2 months ago
- antifunext☆34Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- A Coq development of the theory of Indexed W types with function extensionality.☆11Updated 8 years ago