Alternatives and similar repositories for refscript:

Users that are interested in refscript 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 7 years ago
• yallop / higher
  Higher-kinded programming in OCaml
  ☆181Updated last year
• paf31 / purescript-incremental-functions
  Incremental lambda calculus
  ☆81Updated 5 years ago
• ocamllabs / ocaml-modular-implicits
  OCaml extended with modular implicits
  ☆104Updated 6 years ago
• agda-attic / agda-frp-js
  ECMAScript back end for Functional Reactive Programming in Agda
  ☆104Updated 7 years ago
• ravichugh / djs
  Dependent JavaScript: A Typed Dialect
  ☆87Updated 11 years ago
• swr1bm86 / vscode-idris
  Idris for Visual Studio Code
  ☆106Updated 2 years ago
• pa-ba / compdata
  Haskell library implementing "Data Types a la Carte"
  ☆91Updated last year
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆136Updated 6 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• coeffects / coeffects-playground
  Interactive essay that explains theory of coeffects and lets you type-check and run sample programs.
  ☆59Updated 7 years ago
• stedolan / mlsub
  Prototype type inference engine
  ☆201Updated 2 months ago
• rbarreiro / idrisjs
  Js libraries for idris
  ☆49Updated 5 years ago
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆80Updated last year
• suhailshergill / extensible-effects
  Extensible Effects: An Alternative to Monad Transformers
  ☆174Updated 4 years ago
• ziman / lightyear
  Parser combinators for Idris
  ☆242Updated 6 years ago
• purescript / purescript-free
  Free monads, Cofree comonads, Yoneda and Coyoneda functors, and the Trampoline monad.
  ☆94Updated last year
• cmcl / frankjnr
  Another implementation of Frank.
  ☆70Updated 7 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆93Updated last year
• frank-lang / frank
  Frank compiler
  ☆288Updated 11 months ago
• yallop / fomega
  System Fω interpreter for use in Advanced Functional Programming course
  ☆65Updated last year
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 5 years ago
• atennapel / bidirectional.js
  Javascript implementation of "Complete and Easy Bidirectional Type Checking for Higher-Rank Polymorphism"
  ☆75Updated 8 months ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆114Updated 4 years ago
• idris-hackers / atom-language-idris
  A Idris Mode for Atom.io
  ☆101Updated 8 months ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• purescript-contrib / purescript-parsing
  A parser combinator library based on Parsec
  ☆153Updated last month
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• siegebell / vscoq
  Coq Support for Visual Studio Code
  ☆92Updated 5 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago