OPLSS / oplss-notes-2017
handouts and notes from the 2017 edition of the summer school
☆39Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for oplss-notes-2017
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆69Updated 2 years ago
- being the materials for Summer 2013's course☆110Updated last year
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Where my everyday research happens☆53Updated 2 months ago
- The Evolution of a Typechecker☆52Updated 5 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- System F in coq.☆19Updated 9 years ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- ☆82Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A Racket library for interacting with Idris over the IDE protocol☆30Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 2 weeks ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Work in progress☆34Updated 3 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 weeks ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 10 months ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago