OPLSS / oplss-notes-2018
Notes and handouts from OPLSS 2018
☆53Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for oplss-notes-2018
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- ☆80Updated 6 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 3 weeks ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- being the materials for Summer 2013's course☆110Updated last year
- The Prettiest Printer☆35Updated 9 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- An enhanced unification algorithm for Coq☆49Updated 5 months ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- A tutorial on how Agda infers things☆36Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 10 months ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- MetaML and MetaOCaml bibliography☆85Updated 2 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago