Ocaml Constraint Programming Library

Edit Package ocaml-facile
https://github.com/Emmanuel-PLF/facile

FaCiLe is a constraint programming library on integer and integer set
finite domains written in OCaml. It offers all usual facilities to
create and manipulate finite domain variables, arithmetic expressions
and constraints (possibly non-linear), built-in global constraints
(difference, cardinality, sorting etc.) and search and optimization
goals. FaCiLe as well allows you to build easily user-defined
constraints and goals (including recursive ones), making pervasive use
of OCaml higher-order functionals to provide a simple and flexible
interface for the user. As FaCiLe is an OCaml library and not "yet
another language", the user benefits from type inference and strong
typing discipline, high level of abstraction, a modules and objects
system, as well as native code compilation efficiency, garbage
collection and replay debugger, all features of OCaml (among many
others) that allow to prototype and experiment quickly: modeling, data
processing and interface are implemented with the same powerful and
efficient language.

Refresh
Refresh
Source Files (show unmerged sources)
Filename Size Changed
_service 0000000680 680 Bytes
ocaml-facile-1.1.4.tar.xz 0000083232 81.3 KB
ocaml-facile.changes 0000001707 1.67 KB
ocaml-facile.patch 0000002665 2.6 KB
ocaml-facile.spec 0000002792 2.73 KB
Latest Revision
buildservice-autocommit accepted request 967048 from Olaf Hering's avatar Olaf Hering (olh) (revision 19)
baserev update by copy to link target
Comments 0
openSUSE Build Service is sponsored by