Alternatives and similar repositories for TaPL-SML:

Users that are interested in TaPL-SML are comparing it to the libraries listed below

• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• JohnReppy / compiling-pattern-guards
  Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
  ☆25Updated 2 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆33Updated 7 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 4 months ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆54Updated 5 years ago
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 6 years ago
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 7 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆43Updated 2 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 10 years ago
• JohnReppy / sml-compiler-utils
  A collection of SML utility modules that are useful for compiler writing.
  ☆11Updated last month
• diku-dk / sigdoc
  Signature documentation tool for Standard ML
  ☆14Updated last year
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 9 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 7 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated last year
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago
• jsiek / B629-denotational
  Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
  ☆72Updated 6 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 2 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 9 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 11 years ago
• nojb / mlpolyr
  MLpolyR
  ☆7Updated 8 years ago