handouts and notes from the 2017 edition of the summer school
☆39Jul 13, 2017Updated 8 years ago
Alternatives and similar repositories for oplss-notes-2017
Users that are interested in oplss-notes-2017 are comparing it to the libraries listed below
Sorting:
- Logical relations proof in Agda☆27May 27, 2015Updated 10 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Notes and handouts from OPLSS 2018☆55Jul 23, 2018Updated 7 years ago
- Lecture material for DeepSpec Summer School 2017☆90Aug 31, 2021Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Oct 22, 2024Updated last year
- A reflection-based proof tactic for lattices in Coq☆21Oct 15, 2023Updated 2 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Summer school on programming in Agda☆68Aug 1, 2023Updated 2 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- ☆21Apr 15, 2018Updated 7 years ago
- ☆86Sep 7, 2017Updated 8 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- being the lecture materials and exercises for the 2017/18 session of CS410 Advanced Functional Programming at the University of Strathcly…☆264May 16, 2018Updated 7 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Oct 25, 2022Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 8 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Idris GraphQL☆16Dec 16, 2017Updated 8 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 5 months ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Mar 21, 2024Updated last year
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- A well-typed symmetric-monoidal category of concurrent processes☆25Nov 12, 2018Updated 7 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- gallina frontend for CompCert☆19Jul 6, 2019Updated 6 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- Formal topology (and some probability) in Coq☆31Nov 30, 2018Updated 7 years ago
- System F implemented in Haskell☆24Mar 15, 2012Updated 13 years ago