Alternatives and similar repositories for reachability:

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

• Kraks / diamond-lang
  A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.
  ☆44Updated 2 weeks ago
• euisuny / best-of-popl
  Best of POPL (BOP) Reading Group Memoirs
  ☆67Updated 3 years ago
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆72Updated last year
• lexa-lang / lexa
  ☆30Updated 5 months ago
• zydeco-lang / zydeco
  a proof-of-concept programming language based on Call-by-push-value
  ☆53Updated 3 weeks ago
• arthuraa / extructures
  Finite sets and maps for Coq with extensional equality
  ☆29Updated 3 months ago
• cu1ch3n / type-inference-zoo
  🦖 Implementations of various type inference algorithms. Online interactive playground is available at https://zoo.cuichen.cc/
  ☆22Updated 3 weeks ago
• Tritlo / PropR
  Genetic program repair using GHC
  ☆30Updated 10 months ago
• lsrcz / grisette
  A monadic library for symbolic evaluation
  ☆59Updated 3 weeks ago
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆19Updated last year
• Kraks / sai
  Staged Abstract Interpreters
  ☆65Updated 2 years ago
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆34Updated 3 months ago
• kwanghoon / bidi
  bidirectional type checking algorithms for higher-ranked polymorphism
  ☆19Updated 3 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆67Updated last month
• plclub / cbpv-effects-coeffects
  Formalization of CBPV extended with effect and coeffect tracking
  ☆12Updated 6 months ago
• WasmCert / WasmCert-Coq
  A mechanisation of Wasm in Coq(Rocq)
  ☆101Updated this week
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated 2 years ago
• csabahruska / p4f-control-flow-analysis
  Haskell implementation of P4F Control-Flow Analysis
  ☆21Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 4 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆35Updated last year
• svenkeidel / sturdy
  Sturdy is a library for developing sound static analyses in Haskell.
  ☆61Updated 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 …
  ☆50Updated 3 weeks ago
• matthesjh / coq-tal
  Formalization of Typed Assembly Language (TAL) in Coq
  ☆17Updated last year
• coq-community / graph-theory
  Graph Theory [maintainers=@chdoc,@damien-pous]
  ☆36Updated last month
• mit-plv / coqutil
  Coq library for tactics, basic definitions, sets, maps
  ☆44Updated 2 weeks ago
• foreverbell / verified
  Coq formalizations and proofs of (data) structures and algorithms.
  ☆46Updated 6 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆70Updated 3 months ago
• verse-lab / bythos
  Compositional Verification of Composite Byzantine Protocols
  ☆12Updated 6 months ago