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:
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 7 months ago
- ☆84Updated 8 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A TACtic library for Agda☆50Updated last year
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 3 years ago
- Formal semantics in Agda.☆16Updated 10 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- Miller/pattern unification in Agda☆68Updated 11 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Paper and talk☆55Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago