Alternatives and similar repositories for inverse-bidirectional-typechecking:

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

• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 2 weeks ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 3 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 4 years ago
• forked-from-1kasper / anders
  Anders: Cubical Type Checker
  ☆24Updated last year
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆19Updated 6 months ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated last month
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 6 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• peterthiemann / definitional-session
  ☆12Updated 5 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆34Updated last week
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆32Updated 3 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 4 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 3 weeks ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 3 years ago