patrikja / AFPcourseLinks
http://www.cse.chalmers.se/edu/course/afp/
☆16Updated 9 years ago
Alternatives and similar repositories for AFPcourse
Users that are interested in AFPcourse are comparing it to the libraries listed below
Sorting:
- Where my everyday research happens☆55Updated last month
- ☆45Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Formalization of Linear Logic☆10Updated 8 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- Category theory and algebra☆26Updated 9 years ago
- A simple GUI for Agda☆31Updated 9 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Library of categories, with categorical constructions on them☆58Updated 2 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- ☆84Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- ☆20Updated last year
- second-order abstract syntax☆31Updated 4 years ago
- Summer school on programming in Agda☆68Updated 2 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆126Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago