Alternatives and similar repositories for Bidirectional

Users that are interested in Bidirectional 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
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆66Updated 8 years ago
• ollef / rock
  Build system
  ☆131Updated last month
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 9 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated 2 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 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
• astampoulis / makam
  The Makam Metalanguage
  ☆197Updated 2 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆116Updated 4 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆130Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 4 months ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆172Updated this week
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆43Updated 6 years ago
• idris-community / inigo
  Inigo: A Package Manager for Idris2
  ☆62Updated 3 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆192Updated 8 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 7 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆148Updated 2 weeks ago
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆117Updated last year
• chessai / theseus
  theseus, functional programming language with fully reversible computation
  ☆124Updated 6 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆96Updated 2 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years 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