smbc
Sat Modulo Bounded Checking
Description
A model finder for a purely functional language with unknowns, similar to functional logic programming. It relies on a SAT solver (msat) to prune the search space efficiently.
Install
- Published
-
29 Aug 2017
- Authors
-
- Maintainers
-
Sources
Dependencies
tip-parser
>= "0.3" & < "0.4"
msat
>= "0.5" & < "0.8"
sequence
>= "0.4"
containers
>= "1.0" & < "2.0"
ocamlfind
build
ocaml
>= "4.01"
Reverse Dependencies