chrisamaphone / lf-class
Logical Frameworks Class
☆11Updated last year
Alternatives and similar repositories for lf-class
Users that are interested in lf-class are comparing it to the libraries listed below
Sorting:
- Experiments with Realizability in Univalent Type Theory☆18Updated 6 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 8 months ago
- Notes (and implementation) of unification with binders☆14Updated this week
- Agda to C compiler☆10Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Formal Semantics for Why3☆18Updated this week
- Intrinsic Verification of Formal Grammar Theory☆20Updated this week
- ☆13Updated last month
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- Mechanizations of Type Theories☆28Updated 2 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
- A cost-aware logical framework, embedded in Agda.☆61Updated this week
- ☆29Updated 2 years ago
- ☆29Updated 2 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- ☆14Updated last month
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Updated 2 months ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 2 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- A formalization of the theory behind the mugen library☆19Updated 10 months ago
- For Jar artifacts☆14Updated 2 months ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 8 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 2 weeks ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated last year
- Finite sets and maps for Coq with extensional equality☆30Updated 5 months ago
- Deadlock freedom by type checking☆20Updated last year