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:
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated this week
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- The Penn Locally Nameless Metatheory Library☆76Updated 9 months ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- ☆84Updated last year
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- ☆85Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- A TACtic library for Agda☆50Updated last year
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Simplified Observational Type Theory☆86Updated 2 years ago