joshrule / term-rewriting-rs
a Rust implementation of first-order term rewriting systems (TRS)
☆27Updated 3 years ago
Alternatives and similar repositories for term-rewriting-rs:
Users that are interested in term-rewriting-rs are comparing it to the libraries listed below
- An LLVM interface for Lean 4. (WIP)☆20Updated last year
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago
- A cyclic theorem prover framework.☆32Updated 2 weeks ago
- Datalog + Egg = Good☆66Updated last year
- Cyclic theorem prover for equalitional reasoning using egraphs☆26Updated last year
- Rust bindings for the Lean 4 proof assistant☆22Updated 2 months ago
- An arbitrary-precision differentiable programming language.☆35Updated last year
- Gallina to Bedrock2 compilation toolkit☆53Updated this week
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆35Updated 3 weeks ago
- An encyclopedia of proofs☆59Updated 5 months ago
- A Rust hashconsing library.☆32Updated 9 months ago
- An automated theorem prover that uses Büchi automata.☆41Updated 3 years ago
- An automated deductive program verifier.☆42Updated 2 years ago
- Symbolic Geometric Algebra with E-Graphs☆19Updated last year
- Python library for program synthesis and symbolic execution combining constraint solving and LLMs☆17Updated 3 weeks ago
- A synthesis-enabled solver for relational logic☆27Updated 6 years ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆68Updated 2 years ago
- Szalinski: A Tool for Synthesizing Structured CAD Models with Equality Saturation and Inverse Transformations☆46Updated last year
- Pedagogical first-order prover in Python☆75Updated this week
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Human-like theorem prover, inspired by robotone and developed in the Coq ecosystem.☆16Updated 2 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆42Updated 2 months ago
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 7 years ago
- A formally verified bug finder☆14Updated 4 months ago
- EGraphs in OCaml☆64Updated last year
- Pull your compiler up with abstract bootstraps.☆31Updated 2 years ago
- SPSC: A Small Positive Supercompiler☆35Updated 10 months ago
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago