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 7 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆80Updated last year
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆93Updated last year
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆121Updated 3 months ago
• discus-lang / ddc
  The Disco Discus Compiler
  ☆174Updated 6 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 9 months ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• chrisdone-archive / prana
  Interpreter for GHC Haskell
  ☆22Updated 5 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 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 5 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 4 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 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
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆58Updated 6 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• ChrisPenner / mad-props
  Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.
  ☆67Updated 2 years ago
• aherrmann / simply_llvm
  ☆41Updated 7 years ago
• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆163Updated 4 months ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• dorchard / effect-monad
  Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.
  ☆100Updated last year
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• jfdm / idris-containers
  Various data structures for use in the Idris Language.
  ☆95Updated 4 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆171Updated 6 years ago