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).
  ☆11Updated 10 months ago
• koengit / intuit
  An automated theorem prover for intuitionistic propostional logic
  ☆14Updated 5 years ago
• umazalakain / typing-linear-pi
  Typing the linear pi calculus in Agda
  ☆29Updated 3 years ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆65Updated last week
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated 2 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• verse-lab / ego
  EGraphs in OCaml
  ☆79Updated 2 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• appliedfm / vstyle
  A style guide for Coq
  ☆18Updated 4 years ago
• mit-plv / coqutil
  Coq library for tactics, basic definitions, sets, maps
  ☆51Updated last month
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆35Updated 4 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆48Updated 5 years ago
• rocq-community / coq-program-verification-template
  Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…
  ☆35Updated last year
• maxsnew / grammars-and-semantic-actions
  Intrinsic Verification of Formal Grammar Theory
  ☆27Updated last month
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆57Updated last week
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 9 months ago
• bedrocksystems / coq-lens
  Lenses in Coq
  ☆17Updated 3 years ago
• tchajed / iris-simp-lang
  We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …
  ☆57Updated 6 months ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 8 months ago
• lsrcz / grisette
  A monadic library for symbolic evaluation
  ☆72Updated 6 months ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last month
• verse-lab / lean-ssr
  LeanSSR: an SSReflect-Like Tactic Language for Lean
  ☆40Updated last month
• robsimmons / abbot
  Generation of abstract binding trees
  ☆27Updated 3 months ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆31Updated 4 years ago
• fblanqui / color
  Coq library on rewriting theory and termination
  ☆37Updated last month
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆28Updated 3 months ago
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 5 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆24Updated last year
• rocq-community / metaprogramming-rosetta-stone
  A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…
  ☆17Updated last year