Elderry / TaPL-SMLLinks
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
Sorting:
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- The Prettiest Printer☆35Updated last year
- A collection of SML utility modules that are useful for compiler writing.☆11Updated 2 months ago
- System F in coq.☆19Updated 10 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆73Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 weeks ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ☆26Updated 8 years ago
- Logical relations proof in Agda☆26Updated 10 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 2 months ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 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
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago