From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.1.3 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 68C3EBC6B for ; Fri, 13 Oct 2006 14:41:45 +0200 (CEST) Received: from mail.rsise.anu.edu.au (mail.rsise.anu.edu.au [150.203.208.4]) by concorde.inria.fr (8.13.6/8.13.6) with ESMTP id k9DCffWL028966 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO) for ; Fri, 13 Oct 2006 14:41:44 +0200 Received: from localhost (localhost [127.0.0.1]) by mail.rsise.anu.edu.au (Postfix) with ESMTP id 2ECB753F51; Fri, 13 Oct 2006 22:41:39 +1000 (EST) Received: from mail.rsise.anu.edu.au ([150.203.208.4]) by localhost (mail [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 07870-10; Fri, 13 Oct 2006 22:41:39 +1000 (EST) Received: from pulp.rsise.anu.edu.au (pulp.rsise.anu.edu.au [150.203.208.49]) by mail.rsise.anu.edu.au (Postfix) with ESMTP id 155D653F2D; Fri, 13 Oct 2006 22:41:30 +1000 (EST) Received: by pulp.rsise.anu.edu.au (Postfix, from userid 1560) id 7D1C0A0AFC7; Fri, 13 Oct 2006 22:42:23 +1000 (EST) Date: Fri, 13 Oct 2006 22:42:23 +1000 From: Pietro Abate To: caml-list@yquem.inria.fr, caml-list@inria.fr Subject: Re: [Caml-list] Type inference inside exceptions ? Message-ID: <20061013124223.GA30832@pulp.rsise.anu.edu.au> Mail-Followup-To: Pietro Abate , caml-list@yquem.inria.fr, caml-list@inria.fr References: <20061006201647.1a88vj0tkockc4k8@webmail.etu.upmc.fr> <452D753E.1020607@glondu.net> <20061013142317.z70cu8q30g40gckc@webmail.etu.upmc.fr> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20061013142317.z70cu8q30g40gckc@webmail.etu.upmc.fr> X-Operating-System: GNU/Linux X-Organization: Research School of Information Science and Engineering (Australian National University) User-Agent: Mutt/1.5.13 (2006-08-11) X-Virus-Scanned: by amavisd-new-20030616-p10 (Debian) at mail.rsise.anu.edu.au X-Miltered: at concorde with ID 452F8985.001 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; inference:01 pons:01 reordering:01 defines:01 node:01 stack:01 discrepancy:01 pointer:01 delimited:01 2006:98 phane:98 steph:98 blog:98 blog:98 wrote:01 On Fri, Oct 13, 2006 at 02:23:17PM +0200, Diego Olivier FERNANDEZ PONS wrote: > Quoting St??phane Glondu : > >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