ionathanch / TTBFLLinks
A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
☆19Updated 3 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
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- my phd thesis☆26Updated 11 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- being a particular fragment of Haskell, extended to a proof system☆33Updated this week
- ☆17Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆36Updated 3 years ago
- Experimental implementation of a Cubical Type Theory modeled by presheaves over posets☆11Updated 11 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 10 months 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
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 9 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years 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
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- ☆29Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆21Updated last week
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- A formalization of the theory behind the mugen library☆19Updated last year
- Agda to C compiler☆10Updated 2 years ago
- ☆21Updated 3 years ago
- ☆15Updated last year