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
0.4.1.tar.gz
md5=e02a268970ff6d19f153d31113c5c338
Dependencies
tip-parser >= "0.3" & < "0.4"
msat >= "0.5" & < "0.8"
sequence >= "0.4"
containers >= "1.0" & < "2.0"
ocaml >= "4.01"
Reverse Dependencies