On Fri, Oct 13, 2006 at 02:23:17PM +0200, Diego Olivier FERNANDEZ PONS wrote:
> Quoting St??phane Glondu <steph@glondu.net>:
> >I don't really understand what you are doing: why do you generate a list
> >of continuations instead of a single one?
> Reordering the continuations to continue the computation in an other  
> branch than the deepest try ... fail is a classical technique in  
> combinatorial optimization. The way you order your continuations  
> defines a "node ordering strategy", most usual being :
> - stack -> depth first search
> - queue -> limited discrepancy search
> - priority queue -> best first search

Can you give some pointer about this technique ... I guess I've already
seen/used it, but maybe in disguise... is this related with delimited
continuations and some kind of lookahead technique to detect failures
and backtrack ?

thanks!
:)
p

-- 
++ Blog: http://blog.rsise.anu.edu.au/?q=pietro
++ 
++ "All great truths begin as blasphemies." -George Bernard Shaw
++ Please avoid sending me Word or PowerPoint attachments.
   See http://www.fsf.org/philosophy/no-word-attachments.html