From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by yquem.inria.fr (Postfix) with ESMTP id B2B42BBBB for ; Sun, 26 Feb 2006 22:03:04 +0100 (CET) Received: from shiva.jussieu.fr (shiva.jussieu.fr [134.157.0.129]) by concorde.inria.fr (8.13.0/8.13.0) with ESMTP id k1QL33nN006273 for ; Sun, 26 Feb 2006 22:03:03 +0100 Received: from ibm3.cicrp.jussieu.fr (ibm3.cicrp.jussieu.fr [134.157.15.3]) by shiva.jussieu.fr (8.13.5/jtpda-5.4) with ESMTP id k1QL2uZr064036 ; Sun, 26 Feb 2006 22:02:56 +0100 (CET) X-Ids: 168 Received: from ibm1.cicrp.jussieu.fr (ibm1.cicrp.jussieu.fr [134.157.15.1]) by ibm3.cicrp.jussieu.fr (8.8.8/jtpda/mob-V8) with ESMTP id VAA319588 ; Sun, 26 Feb 2006 21:58:17 +0100 Received: from localhost (fernande@localhost) by ibm1.cicrp.jussieu.fr (8.8.8/jtpda/mob-v8) with ESMTP id WAA1073394 ; Sun, 26 Feb 2006 22:03:03 +0100 Date: Sun, 26 Feb 2006 22:03:02 +0100 (NFT) From: Diego Olivier Fernandez Pons To: Brian Hurt Cc: OCaml Mailing List Subject: Re: [Caml-list] algorithm question In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Greylist: Sender IP whitelisted, not delayed by milter-greylist-1.7.2 (shiva.jussieu.fr [134.157.0.168]); Sun, 26 Feb 2006 22:02:56 +0100 (CET) X-Antivirus: scanned by sophie at shiva.jussieu.fr X-Miltered: at concorde with ID 44021787.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at shiva.jussieu.fr with ID 44021780.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; pons:01 pons:01 caml-list:01 orthogonal:01 trailing:01 restores:01 implements:01 node:01 algorithm:01 caml:02 partially:02 functional:02 programming:03 handles:03 problem:05 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.3 Bonjour, > It's solving a problem that doesn't show up in functional programming. It is orthogonal : FaCiLe is written in Caml and handles backtrack by trailing (in other words it keeps only one copy of each object and restores its state when needed). On the other hand Gecode implements (partially) node sharing and is written in C++ Diego Olivier