Alternatives and similar repositories for bidi

Users that are interested in bidi are comparing it to the libraries listed below

• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆85Updated 4 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 9 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 5 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 5 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆63Updated 5 months ago
• faulhornlabs / csip
  ☆24Updated 3 weeks ago
• morphismtech / distributors
  Distributors - Unifying Parsers, Printers & Grammars
  ☆59Updated 2 weeks ago
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 3 years ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆55Updated 2 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆28Updated 2 months ago
• frex-project / idris-frex
  ☆51Updated 4 months ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆56Updated 2 years ago
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆29Updated 2 weeks ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆30Updated 6 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆127Updated 10 years ago
• kwanghoon / polyrpc
  PolyRPC, A multi-tier functional programming language
  ☆20Updated 3 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆55Updated 3 months ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆61Updated 3 weeks ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆47Updated 3 years ago
• phijor / agda-mode-ng
  Let's rethink how we interact with Agda
  ☆18Updated 3 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆45Updated 10 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago