OPLSS / oplss-notes-2018Links
Notes and handouts from OPLSS 2018
☆55Updated 7 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
Sorting:
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated this week
- Unification and type inference algorithms☆125Updated 10 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- ☆84Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A TACtic library for Agda☆49Updated 10 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- A tutorial on how Agda infers things☆60Updated 3 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- The Prettiest Printer☆35Updated last year
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago