zenon-prover / zenonLinks
The Zenon theorem prover
☆15Updated 2 years ago
Alternatives and similar repositories for zenon
Users that are interested in zenon are comparing it to the libraries listed below
Sorting:
- Experimental model finder/SMT solver for functional programming.☆23Updated 3 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated 10 months ago
- Coq library for serialization to S-expressions☆19Updated 2 years ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- Formalising session types in Coq☆17Updated 6 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]☆28Updated 5 months ago
- Relation algebra library for Coq☆49Updated 5 months ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated last year
- First-order automated theorem prover based on the tableau method☆17Updated 3 weeks ago
- Partial Commutative Monoids☆29Updated 3 months ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆35Updated this week
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- Code for "Staged Generic Programming" (ICFP 2017)☆27Updated 2 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Updated last year
- multi-shot continuations in OCaml☆48Updated 7 months ago
- A simple BDD library for OCaml☆13Updated 3 months ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated last month
- Lenses in Coq☆17Updated 2 years ago
- Tactic for polynomial manipulations☆11Updated 4 months ago
- Library for Classical Coq☆39Updated 3 months ago
- 🌳 Generate a fresh bonsai in your terminal☆28Updated 3 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago