ReedOei / PecanLinks
An automated theorem prover that uses Büchi automata.
☆42Updated 3 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☆59Updated this week
- Python bindings for the Coq interactive proof assistant☆55Updated 3 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- Hoare Type Theory☆78Updated 3 months ago
- Pedagogical first-order prover in Python☆76Updated 3 months ago
- Convert Haskell source code to Coq source code.☆87Updated 2 months ago
- Real number computation software☆126Updated 3 years ago
- Coq library for tactics, basic definitions, sets, maps☆49Updated last week
- A (formalised) general definition of type theories☆57Updated 4 years ago
- HoTT in Lean 3☆81Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 weeks ago
- EGraphs in OCaml☆72Updated last year
- An encyclopedia of proofs☆62Updated 10 months ago
- Coq library for verified low-level programming☆60Updated 8 years ago
- A Rocq formalization of information theory and linear error-correcting codes☆72Updated last week
- An automated deductive program verifier.☆42Updated 2 years ago
- Relation algebra library for Coq☆49Updated 5 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- A heuristic procedure for proving inequalities☆33Updated 7 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆154Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated 11 months ago
- A monadic library for symbolic evaluation☆69Updated last month
- Communication between Coq and SAT/SMT solvers☆160Updated 11 months ago
- Coq Protocol Playground with Se(xp)rialization of Internal Structures.☆133Updated 10 months ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- A library of mechanised undecidability proofs in the Coq proof assistant.☆120Updated last month
- Specification of the Cedille Core language☆32Updated 5 years ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- ☆55Updated 5 months ago