liamoc / dddp
Deferring the Details and Deriving Programs
☆14Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for dddp
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 2 years ago
- NbE course @ Chalmers☆28Updated last month
- 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 8 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- Coq library for handling names☆18Updated 2 years ago
- ☆16Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 2 years ago
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆25Updated 2 weeks ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- what I did on my holidays☆12Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Category theory and algebra☆27Updated 8 years ago
- Agda formalisation of NbE for λ□☆17Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 4 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- ☆21Updated 4 months ago