effectfully / random-stuffLinks
☆19Updated 11 months ago
Alternatives and similar repositories for random-stuff
Users that are interested in random-stuff are comparing it to the libraries listed below
Sorting:
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- what I did on my holidays☆12Updated 7 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- NbE course @ Chalmers☆28Updated 10 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- 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
- Category theory and algebra☆28Updated 8 years ago
- Mtac in Agda☆28Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆16Updated 3 years ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- ☆45Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Where my everyday research happens☆54Updated last month