charliermarsh / OCaml-SAT-Solvers
An OCaml implementation of the DPLL algorithm for solving SAT instances. Uses nothing beyond the OCaml List library.
☆19Updated 10 years ago
Alternatives and similar repositories for OCaml-SAT-Solvers:
Users that are interested in OCaml-SAT-Solvers are comparing it to the libraries listed below
- ☆55Updated last week
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- A generic goal preprocessing tool for proof automation tactics in Coq☆16Updated 4 months ago
- Essentials of Programming Languages, with OCaml implementations & Coq proofs☆32Updated 8 years ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- Choice operator in OCaml, providing a backtracking monad☆25Updated 3 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated last year
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- An overlay for the OCaml Z3 binding.☆34Updated 2 years ago
- OCaml hash-consing library☆51Updated last year
- Formalising session types in Coq☆17Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated last year
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- Make OCaml native debugging awesome☆32Updated 5 years ago
- Relation algebra library for Coq☆48Updated 2 weeks ago
- DOrder -- Automatically Learning Shape Specifications☆20Updated 7 years ago
- OCaml library for partially ordered maps☆16Updated 2 months ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆24Updated 2 months ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 2 months ago
- Lecture material for DeepSpec Summer School 2018☆68Updated 6 years ago
- An OCaml EDSL for describing and solving strategic games☆17Updated last year
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 4 years ago
- A modular sat/smt solver with proof output.☆99Updated last year
- Racket bindings for Z3☆24Updated 5 years ago
- EGraphs in OCaml☆64Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A proof of Abel-Ruffini theorem.☆29Updated last month
- Monadic effects and equational reasonig in Coq☆70Updated last month