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
• ollef / rock
  Build system
  ☆123Updated last year
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆141Updated 6 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 8 years ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last week
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 5 months ago
• astampoulis / makam
  The Makam Metalanguage
  ☆198Updated 2 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 / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆189Updated 7 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆95Updated last year
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆118Updated 2 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• idris-community / inigo
  Inigo: A Package Manager for Idris2
  ☆62Updated 2 years ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆205Updated 5 years ago
• wilbowma / pl-thesaurus
  ☆90Updated 3 years ago
• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆165Updated last month
• grin-compiler / ghc-grin
  GRIN backend for GHC
  ☆144Updated 3 years ago
• robrix / path
  A lambda calculus to explore type-directed program synthesis.
  ☆85Updated 5 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.
  ☆81Updated 3 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 4 years ago