Alternatives and similar repositories for row-polymorphism

Users that are interested in row-polymorphism are comparing it to the libraries listed below

• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 3 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 9 years ago
• aherrmann / simply_llvm
  ☆41Updated 8 years ago
• david-christiansen / idris-type-providers
  Type provider library for Idris
  ☆95Updated 8 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 7 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 8 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆86Updated 4 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆134Updated 5 years ago
• andgate / type-theory-compiler
  Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…
  ☆44Updated 6 years ago
• cmcl / franklyfrank
  A prototype implementation of the Frank programming language
  ☆17Updated 9 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated 3 weeks ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆92Updated 4 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆116Updated 5 years ago
• mbg / hindley-milner
  Template for Hindley-Milner based languages
  ☆39Updated 4 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 12 years ago
• elpinal / modules-rs
  An interpreter of F-ing modules
  ☆19Updated 6 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆99Updated 2 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• ollef / rock
  Build system
  ☆134Updated 3 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• vmchale / atspkg
  Build tool for ATS.
  ☆42Updated 3 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 6 years ago
• jfaure / lfvm-stg
  Map lazy functional language constructs to LLVM IR
  ☆52Updated 6 years ago