AdrienChampion / hashconsingLinks
A Rust hashconsing library.
☆32Updated 10 months ago
Alternatives and similar repositories for hashconsing
Users that are interested in hashconsing are comparing it to the libraries listed below
Sorting:
- Easy SMT solver interaction☆35Updated 2 months ago
- Liquid Types implementation for Rust☆29Updated 2 years ago
- A generic library to interact with SMT-LIB 2 compliant solvers running in a separate system process, such as Z3 and CVC4.☆66Updated last year
- The Pulse separation logic DSL for F*☆16Updated this week
- MiniSat reimplemented in Rust☆20Updated 7 years ago
- LLVM support for the lean theorem prover☆48Updated 3 years ago
- ☆23Updated last week
- RustHorn: A CHC-based automated verifier for Rust☆83Updated 2 months ago
- Refreshing automation for inductive equational proofs using e-graphs☆20Updated 10 months ago
- The Steel separation logic library for F*☆35Updated 3 weeks ago
- Human-like theorem prover, inspired by robotone and developed in the Coq ecosystem.☆17Updated 3 years ago
- Datalog + Egg = Good☆66Updated 2 years ago
- Coq library for tactics, basic definitions, sets, maps☆48Updated this week
- A modern (trail saving, clause subsumption/vivification, learning-rate based selecting, rephrase) CDCL SAT solver in Rust☆93Updated last week
- Alternative implementation of the logical framework Dedukti in Rust☆21Updated last month
- embedding MLIR in LEAN☆47Updated 11 months ago
- Rust bindings for the Lean 4 proof assistant☆23Updated 3 months ago
- SMTscope automatically analyses and visualises SMT solver execution traces.☆37Updated 2 months ago
- An LLVM interface for Lean 4. (WIP)☆21Updated last year
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆44Updated 2 months ago
- Formally verified implementation of Alive in Lean☆36Updated last year
- A high-level API for interacting with SMT solvers.☆28Updated 3 weeks ago
- ☆49Updated 3 months ago
- Probabilistic separation logics for verifying higher-order probabilistic programs.☆23Updated this week
- dependent type theory experiment☆26Updated last year
- EGraphs in OCaml☆65Updated last year
- An experimental optimizing compiler for Bril☆69Updated this week
- A prototype for a monadic program logic in Lean☆33Updated this week
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago