plclub / cis670-16faLinks
Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016
☆42Updated 2 years ago
Alternatives and similar repositories for cis670-16fa
Users that are interested in cis670-16fa are comparing it to the libraries listed below
Sorting:
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 7 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- MetaML and MetaOCaml bibliography☆91Updated 6 months ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- 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
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- ☆84Updated 7 years ago
- Summer school on programming in Agda☆68Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- ☆82Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- The Penn Locally Nameless Metatheory Library☆74Updated 2 months ago
- ☆46Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago