andreasabel / helfLinks
Haskell implementation of the Edinburgh Logical Framework
☆32Updated 3 weeks ago
Alternatives and similar repositories for helf
Users that are interested in helf are comparing it to the libraries listed below
Sorting:
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- Mtac in Agda☆29Updated 4 years ago
- NbE course @ Chalmers☆28Updated last year
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Logical relations proof in Agda☆27Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 2 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 months ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- ☆18Updated 3 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Where my everyday research happens☆56Updated this week
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 9 years ago
- Compiler backend for generating Scheme code☆28Updated 2 months ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- ☆16Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago