OPLSS / oplss-notes-2017Links
handouts and notes from the 2017 edition of the summer school
☆39Updated 8 years ago
Alternatives and similar repositories for oplss-notes-2017
Users that are interested in oplss-notes-2017 are comparing it to the libraries listed below
Sorting:
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Where my everyday research happens☆55Updated last month
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- second-order abstract syntax☆31Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- ☆84Updated 8 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Formalizing nbe in agda☆32Updated 12 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Work in progress☆38Updated 5 months ago
- System F in coq.☆19Updated 10 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Category theory and algebra☆26Updated 9 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year