From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id CAA07016; Tue, 14 Sep 2004 02:01:22 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id CAA08473 for ; Tue, 14 Sep 2004 02:01:21 +0200 (MET DST) Received: from rwcrmhc13.comcast.net (rwcrmhc13.comcast.net [204.127.198.39]) by concorde.inria.fr (8.13.0/8.13.0) with ESMTP id i8E01J4C024871 for ; Tue, 14 Sep 2004 02:01:20 +0200 Received: from x1.einfo.com (c-24-6-118-232.client.comcast.net[24.6.118.232]) by comcast.net (rwcrmhc13) with SMTP id <2004091400011801500occ1ge>; Tue, 14 Sep 2004 00:01:18 +0000 Message-Id: <6.0.3.0.2.20040913165635.0374b130@einfo.com> X-Sender: einfo@einfo.com X-Mailer: QUALCOMM Windows Eudora Version 6.0.3.0 Date: Mon, 13 Sep 2004 17:01:20 -0700 To: caml-list@inria.fr From: Byron Hale Subject: Re: [Caml-list] Announcement: FaCiLe 1.1 Cc: Nicolas Barnier In-Reply-To: <413EE896.6000603@recherche.enac.fr> References: <413EE896.6000603@recherche.enac.fr> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii"; format=flowed X-Miltered: at concorde with ID 414634CF.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Loop: caml-list@inria.fr X-Spam: no; 0.00; byron:01 hale:01 byron:01 hale:01 caml-list:01 aliased:01 aliasing:01 camlers:01 lgpl:01 bug:01 generic:01 bug:01 brisset:01 faq:01 faq:01 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk 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: > > http://www.recherche.enac.fr/opti/facile > >Comments, questions and bug reports are welcome and should be sent >to: > mailto:facileATrechercheDOTenacDOTfr > >Enjoy > >-- Pascal Brisset & Nicolas Barnier > >------------------- >To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr >Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ >Beginner's list: http://groups.yahoo.com/group/ocaml_beginners ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners