ReedOei / PecanLinks
An automated theorem prover that uses Büchi automata.
☆44Updated 4 years ago
Alternatives and similar repositories for Pecan
Users that are interested in Pecan are comparing it to the libraries listed below
Sorting:
- Gallina to Bedrock2 compilation toolkit☆65Updated 3 weeks ago
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- Hoare Type Theory☆84Updated 7 months ago
- EGraphs in OCaml☆80Updated 2 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- An automated deductive program verifier.☆43Updated 2 years ago
- Coq Protocol Playground with Se(xp)rialization of Internal Structures.☆137Updated 2 months ago
- Some scripts to help construct small reproducing examples of bugs, implement [Proof using], etc.☆44Updated last month
- HoTT in Lean 3☆81Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 5 months ago
- Pedagogical first-order prover in Python☆79Updated 7 months ago
- Python bindings for the Coq interactive proof assistant☆57Updated 4 years ago
- Real number computation software☆129Updated 3 years ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆87Updated 3 years ago
- ☆56Updated 2 weeks ago
- A heuristic procedure for proving inequalities☆34Updated 7 years ago
- A library of mechanised undecidability proofs in the Coq proof assistant.☆127Updated last month
- An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…☆152Updated last year
- Relation algebra library for Coq☆50Updated last week
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Updated last year
- Materials for the course "theorem prover lab: applications in programming languages" at KIT, SS2021 edition☆51Updated 4 years ago
- A monadic library for symbolic evaluation☆73Updated 6 months ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- A Seamless, Interactive Tactic Learner and Prover for Coq☆82Updated last month
- Communication between Coq and SAT/SMT solvers☆163Updated 2 weeks ago
- Coq library for tactics, basic definitions, sets, maps☆51Updated last week
- A Lustre compiler in Coq☆71Updated 3 weeks ago
- A mechanisation of Wasm in Isabelle.☆32Updated 3 weeks ago