pigworker / CS410-16Links
being the lecture materials and exercises for the 2016/17 session of Advanced Functional Programming at Strathclyde
☆13Updated 8 years ago
Alternatives and similar repositories for CS410-16
Users that are interested in CS410-16 are comparing it to the libraries listed below
Sorting:
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 9 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Work in progress☆38Updated 5 months ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Updated 8 years ago
- Type theory in type theory☆16Updated 13 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- ☆12Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Formalization of Linear Logic☆11Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- ☆20Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- ☆45Updated 6 years ago