Version française
Home     About     Download     Resources     Contact us    
Browse thread
algorithm question
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Diego Olivier Fernandez Pons <Diego.FERNANDEZ_PONS@e...>
Subject: Re: [Caml-list] algorithm question
    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