OPLSS / oplss-notes-2018
Notes and handouts from OPLSS 2018
☆53Updated 6 years ago
Alternatives and similar repositories for oplss-notes-2018:
Users that are interested in oplss-notes-2018 are comparing it to the libraries listed below
- Unification and type inference algorithms☆125Updated 10 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆109Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆92Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 4 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆55Updated 5 months ago
- being the materials for Summer 2013's course☆112Updated last year
- A TACtic library for Agda☆48Updated 5 months ago
- The Penn Locally Nameless Metatheory Library☆74Updated 8 months ago
- Where my everyday research happens☆52Updated this week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- An enhanced unification algorithm for Coq☆54Updated last week
- ☆82Updated 10 months ago
- ☆84Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- MetaML and MetaOCaml bibliography☆89Updated 3 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated this week
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆69Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆49Updated 7 months ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated last month