gallais / typing-with-leftovers
Self-contained repository for the eponymous paper
☆29Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for typing-with-leftovers
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- ☆11Updated 4 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 weeks ago
- Correctness of normalization-by-evaluation for STLC☆21Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ☆16Updated 2 years ago
- NbE course @ Chalmers☆28Updated last month
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Category theory and algebra☆27Updated 8 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆19Updated 9 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- ☆21Updated 4 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 6 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated last month
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- Logical relations proof in Agda☆24Updated 9 years ago