gallais / typing-with-leftoversLinks
Self-contained repository for the eponymous paper
☆30Updated 6 years ago
Alternatives and similar repositories for typing-with-leftovers
Users that are interested in typing-with-leftovers are comparing it to the libraries listed below
Sorting:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Mtac in Agda☆28Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- ☆16Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- Where my everyday research happens☆54Updated 2 months ago
- Compiler backend for generating Scheme code☆26Updated last year
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Relative Monad Library for Agda☆24Updated 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
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- ☆18Updated 3 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago