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:
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Where my everyday research happens☆54Updated last month
- second-order abstract syntax☆31Updated 3 years ago
- ☆84Updated 7 years ago
- Summer school on programming in Agda☆68Updated 2 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago