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
23 Jan 2018
Sources
0.4.2.tar.gz
md5=b966e738456a3b648a8e780dfcaf5f0c
Dependencies
tip-parser
>= "0.3" & < "0.4"
msat
>= "0.5" & < "0.8"
sequence
>= "0.4"
containers
>= "1.0" & < "3.0"
jbuilder
>= "1.0+beta7"
ocaml
>= "4.03"
Reverse Dependencies