Alternatives and similar repositories for sst-tutorial

Users that are interested in sst-tutorial are comparing it to the libraries listed below

• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆32Updated 6 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated 2 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆94Updated 11 months ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆29Updated 9 months ago
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 6 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• JoeyEremondi / GDTL-artifact
  A Gradual Dependently-typed Language
  ☆14Updated 6 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆49Updated 11 years ago
• RobertHarper / pl-syntax
  PL syntax macros.
  ☆19Updated 2 weeks ago
• logic-tools / sml-handbook
  SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
  ☆36Updated 8 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆102Updated 5 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 years ago
• robsimmons / abbot
  Generation of abstract binding trees
  ☆27Updated last month
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 6 years ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆57Updated this week
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆76Updated 4 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• yzyzsun / CP-next
  The Next Generation of Compositional Programming
  ☆54Updated 2 months ago
• lexi-lambda / racket-higher-rank
  ☆21Updated 8 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆51Updated 2 months ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆46Updated 3 months ago