Alternatives and similar repositories for bidirectional-typing:

Users that are interested in bidirectional-typing are comparing it to the libraries listed below

• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 2 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆58Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated last year
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 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
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• luc-tielen / llvm-codegen
  LLVM code generation in Haskell
  ☆54Updated 5 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆56Updated 4 years ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆82Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated last week
• Russoul / Idris2-Effect
  Experimental effects library for Idris 2
  ☆42Updated 2 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated 2 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆29Updated last year
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆116Updated 2 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 2 months ago
• kritzcreek / fby19
  Type inference from scratch - Material for my talk at F(by)19
  ☆64Updated 5 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆59Updated 3 years ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆91Updated 2 months ago