Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Announcement: FaCiLe 1.1
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Byron Hale <byron.hale@e...>
Subject: Re: [Caml-list] Announcement: FaCiLe 1.1
Does the following quote, "To avoid interferences with other modules of the 
user, all the modules are aliased ...," mean that Facile breaks the 
functional paradigm, which usually includes "no aliasing?"

Thank you for Facile.

Byron Hale

At 04:10 AM 9/8/2004, Nicolas Barnier wrote:
>Dear Camlers,
>Better late than never... it is our pleasure to announce the
>release 1.1 of FaCiLe, a Functional Constraint Library over
>integer and integer set finite domain written with OCaml.
>This library is "Open Source" and licensed under the GNU
>Lesser General Public License (LGPL).
>Beside the overall gain in performance and bug fixes, FaCiLe
>release 1.1 features:
>  - Set variables and constraints
>  - Limited Discrepancy Search
>  - Backtrackable Invariant References
>  - Automatic sharing of arithmetic subexpressions
>  - A complete scheduling example with edge-finding
>FaCiLe distribution includes sources, examples and a generic Makefile,
>as well as the documentation, available at:
>Comments, questions and bug reports are welcome and should be sent
>         mailto:facileATrechercheDOTenacDOTfr
>-- Pascal Brisset & Nicolas Barnier
>To unsubscribe, mail Archives:
>Bug reports: FAQ:
>Beginner's list:

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: