patrikja / AFPcourseLinks
http://www.cse.chalmers.se/edu/course/afp/
☆16Updated 10 years ago
Alternatives and similar repositories for AFPcourse
Users that are interested in AFPcourse are comparing it to the libraries listed below
Sorting:
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- ☆45Updated 6 years ago
- Where my everyday research happens☆56Updated this week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- second-order abstract syntax☆31Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 7 years ago
- Implementing grep in Agda☆33Updated 5 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- A simple GUI for Agda☆31Updated 10 years ago
- Category theory and algebra☆27Updated 9 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- ☆31Updated 11 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Formalization of Linear Logic☆11Updated 8 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated 2 weeks ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- A generic Haskell library for expressing rewrite rules with safe treatment of variables and binders☆12Updated last week
- ☆32Updated 7 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- ☆86Updated 8 years ago