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
• 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
• Kraks / MyPLZoo
  Implementations of various toy programming languages
  ☆12Updated 7 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆104Updated 7 months ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆98Updated last year
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 6 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆16Updated 5 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 5 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆47Updated 5 months ago
• JoeyEremondi / GDTL-artifact
  A Gradual Dependently-typed Language
  ☆14Updated 6 years ago
• yzyzsun / CP-next
  The Next Generation of Compositional Programming
  ☆56Updated 2 weeks ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆51Updated 11 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆57Updated 5 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 3 years ago
• robsimmons / abbot
  Generation of abstract binding trees
  ☆27Updated 3 months ago
• plclub / cbpv-effects-coeffects
  Formalization of CBPV extended with effect and coeffect tracking
  ☆14Updated last year
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago
• SimonJF / mbcheck
  Implementation of typechecker from paper "Special Delivery: Programming with Mailbox Types"
  ☆20Updated 4 months ago
• lexi-lambda / racket-higher-rank
  ☆21Updated 8 years ago
• edwinb / idris2-clibs
  Idris 2 bindings to various C libraries
  ☆15Updated 4 years ago
• brownplt / Resugarer
  Lifting Reduction Semantics through Syntactic Sugar
  ☆13Updated 7 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• hanleyc01 / rkttt
  ☆12Updated 2 years ago
• jdan / compiler.lean
  A formally verified compiler for a simple language with numbers and sums
  ☆27Updated 5 years ago
• mmcqd / higher-standard
  Higher kinded polymorphism in SML
  ☆15Updated 5 years ago