pigworker / CS410-16
being the lecture materials and exercises for the 2016/17 session of Advanced Functional Programming at Strathclyde
☆13Updated 7 years ago
Alternatives and similar repositories for CS410-16:
Users that are interested in CS410-16 are comparing it to the libraries listed below
- STLC-related snippets in Agda☆16Updated 11 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Work in progress☆34Updated 2 months ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 5 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Directed type theory for formal category theory☆17Updated 7 years ago
- what I did on my holidays☆12Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- ☆12Updated 5 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 2 years ago
- Type theory in type theory☆16Updated 12 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated last year
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- Formalization of Linear Logic☆10Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Web based opetopic editor☆35Updated 3 months ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 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
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago