OPLSS / oplss-notes-2018Links
Notes and handouts from OPLSS 2018
☆55Updated 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
Sorting:
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 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 2 years ago
- Paper and talk☆54Updated last year
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- ☆84Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated 3 weeks ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- Automatically exported from code.google.com/p/trellys☆47Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 8 months ago
- A tutorial on how Agda infers things☆43Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- ☆84Updated 7 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago