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 formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Mtac in Agda☆28Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- ☆16Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Where my everyday research happens☆55Updated 2 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 7 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Compiler backend for generating Scheme code☆27Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated this week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Category theory and algebra☆27Updated 9 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Category theory formalized in cubical agda☆21Updated 5 years ago