Alternatives and similar repositories for simple-sub

Users that are interested in simple-sub are comparing it to the libraries listed below

• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆186Updated 7 months ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆173Updated this week
• Storyyeller / cubiml-demo
  A simple ML-like programming language with subtyping and full type inference.
  ☆186Updated last year
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆270Updated last year
• hkust-taco / mlscript
  The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…
  ☆213Updated this week
• ranjitjhala / sprite-lang
  An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
  ☆150Updated 3 months ago
• stedolan / mlsub
  Prototype type inference engine
  ☆205Updated 11 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆62Updated last year
• astampoulis / makam
  The Makam Metalanguage
  ☆198Updated 2 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆66Updated 8 years ago
• wilbowma / pl-thesaurus
  ☆90Updated 4 years ago
• polarity-lang / polarity
  A language with dependent data and codata types
  ☆125Updated 3 weeks ago
• koka-lang / libmprompt
  Robust multi-prompt delimited control and effect handlers in C/C++
  ☆130Updated 2 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 3 months ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆101Updated 3 years ago
• rossberg / 1ml
  1ML prototype interpreter
  ☆290Updated 5 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆133Updated 5 years ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆143Updated 6 years ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆66Updated last month
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆75Updated 2 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆48Updated last year
• ollef / rock
  Build system
  ☆131Updated 2 months ago
• TiarkRompf / reachability
  ☆53Updated 2 months ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• Kraks / diamond-lang
  A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.
  ☆46Updated 9 months ago
• frank-lang / frank
  Frank compiler
  ☆303Updated last year
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆98Updated last month
• Beluga-lang / Beluga
  Contextual types meet mechanized metatheory!
  ☆206Updated 3 months ago
• yzyzsun / CP-next
  The Next Generation of Compositional Programming
  ☆56Updated last week