Alternatives and similar repositories for higher-rank

Users that are interested in higher-rank are comparing it to the libraries listed below

• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆94Updated 8 years ago
• discus-lang / ddc
  The Disco Discus Compiler
  ☆174Updated 6 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• cmcl / frankjnr
  Another implementation of Frank.
  ☆70Updated 7 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆81Updated last year
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• jfdm / idris-containers
  Various data structures for use in the Idris Language.
  ☆95Updated 5 years ago
• jvranish / MiniKanrenT
  An implementation of miniKanren in Haskell
  ☆78Updated 12 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• BekaValentine / SimpleFP-v2
  A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS
  ☆109Updated 8 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆83Updated 2 years ago
• jonsterling / JonPRL
  An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …
  ☆111Updated 6 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆95Updated last year
• aherrmann / simply_llvm
  ☆41Updated 8 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 6 months ago
• aneksteind / Core
  compile your own functional language
  ☆36Updated 6 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated 11 months ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• augustss / djinn
  Generate Haskell code from a type
  ☆136Updated 4 months ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆58Updated 6 years ago
• robrix / path
  A lambda calculus to explore type-directed program synthesis.
  ☆85Updated 5 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• agda-attic / agda-frp-js
  ECMAScript back end for Functional Reactive Programming in Agda
  ☆104Updated 7 years ago