Elderry / TaPL-SMLLinks
Accompanying code for "Types and Programming Languages", ported to Standard ML
☆30Updated 10 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
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- A discouraging story.☆16Updated 7 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- MetaML and MetaOCaml bibliography☆94Updated 7 months ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 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
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- ☆26Updated 8 years ago
- xmonad in Coq☆46Updated 13 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆84Updated last year
- Examples from the class CMSC 330 during Summer 2015☆48Updated 9 years ago
- A very little language☆16Updated 2 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 7 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
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- The Mechanization of Standard ML☆73Updated 2 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 months ago
- A proof assistant for refinement logics☆8Updated 6 years ago