scmu / foundations-harper
Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
☆54Updated 5 years ago
Alternatives and similar repositories for foundations-harper:
Users that are interested in foundations-harper are comparing it to the libraries listed below
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- being the beginnings of at least zero typecheckers☆32Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- The Prettiest Printer☆35Updated 11 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Miller/pattern unification in Agda☆63Updated 10 years ago
- Unification and type inference algorithms☆124Updated 9 years ago
- ☆84Updated 7 years ago
- ☆30Updated 10 years ago
- An enhanced unification algorithm for Coq☆53Updated last week
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆48Updated last month
- The Evolution of a Typechecker☆54Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago