Alternatives and similar repositories for boa

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

• laelath / well-typed-term-generator
  A OCaml generator for well-typed terms (that use their arguments).
  ☆10Updated 8 months ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆58Updated 6 months ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆31Updated 4 years ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆64Updated this week
• lsrcz / grisette
  A monadic library for symbolic evaluation
  ☆71Updated 3 months ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 2 months ago
• umazalakain / typing-linear-pi
  Typing the linear pi calculus in Agda
  ☆29Updated 3 years ago
• verse-lab / ego
  EGraphs in OCaml
  ☆77Updated last year
• uwplse / PUMPKIN-PATCH
  Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker
  ☆52Updated last year
• boyland / sasylf
  Educational Proof Assistant for Type Theory
  ☆80Updated last year
• tchajed / iris-simp-lang
  We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …
  ☆56Updated 4 months ago
• fblanqui / color
  Coq library on rewriting theory and termination
  ☆37Updated 2 months ago
• appliedfm / vstyle
  A style guide for Coq
  ☆18Updated 3 years ago
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 5 years ago
• bedrocksystems / coq-lens
  Lenses in Coq
  ☆17Updated 3 years ago
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated 2 months ago
• mit-plv / coqutil
  Coq library for tactics, basic definitions, sets, maps
  ☆49Updated last month
• cole-k / cc-lemma
  Refreshing automation for inductive equational proofs using e-graphs
  ☆24Updated last year
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated 2 years ago
• siddhartha-gadgil / Saturn
  Experiments with SAT solvers with proofs in Lean 4
  ☆62Updated last year
• Mtac2 / Mtac2
  ☆56Updated 2 weeks ago
• verse-lab / lean-ssr
  LeanSSR: an SSReflect-Like Tactic Language for Lean
  ☆38Updated 2 weeks ago
• arthuraa / extructures
  Finite sets and maps for Coq with extensional equality
  ☆30Updated 4 months ago
• plum-umd / cgc
  Constructive Galois connections
  ☆35Updated 7 years ago
• SMT-LIB / SMT-LIB-2
  Public reference documents for the SMT-LIB standard
  ☆17Updated 2 weeks ago
• vellvm / ctrees
  An itree-like data-structure to additionally support internal non-determinism
  ☆20Updated this week
• lthms / FreeSpec
  A framework for implementing and certifying impure computations in Coq
  ☆53Updated last year
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated last year
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆67Updated last year