OPLSS / oplss-notes-2017
handouts and notes from the 2017 edition of the summer school
☆39Updated 7 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
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 9 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- ☆84Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Where my everyday research happens☆52Updated last week
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- being the materials for Summer 2013's course☆112Updated last year
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- Literature review of GHC's Core language, System FC☆66Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 5 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 2 months ago
- System F in coq.☆19Updated 9 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Logical relations proof in Agda☆26Updated 9 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated last year