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
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated this week
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- The Prettiest Printer☆34Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A discouraging story.☆15Updated 7 years ago
- System F in coq.☆19Updated 10 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
- xmonad in Coq☆46Updated 12 years ago
- Coq code accompanying several articles on semantics of functional programming languages☆11Updated 6 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- ☆26Updated 8 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 weeks ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Verified C programming in Agda☆16Updated 4 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago