Elderry / TaPL-SML
Accompanying code for "Types and Programming Languages", ported to Standard ML
☆30Updated 9 years ago
Alternatives and similar repositories for TaPL-SML:
Users that are interested in TaPL-SML are comparing it to the libraries listed below
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- A discouraging story.☆15Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- ☆26Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 7 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- ☆11Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago