Alternatives and similar repositories for bidi

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

• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆60Updated last month
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 4 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated last week
• frex-project / idris-frex
  ☆48Updated 2 months ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆31Updated 4 years ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated last month
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated last week
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆37Updated 5 years ago
• faulhornlabs / csip
  ☆23Updated 3 weeks ago
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆24Updated 2 weeks ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆30Updated 5 years ago
• blntk / sfpl
  A simple functional programming language.
  ☆21Updated 4 years ago
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆60Updated last year
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆52Updated 2 weeks ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆53Updated last month
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 2 months ago
• davdar / maam
  A monadic approach to static analysis following the methodology of AAM
  ☆18Updated 9 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆74Updated 3 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago