Re: residuation for compositional search?

From: Sebastian Fischer <sebf_at_informatik.uni-kiel.de>
Date: Tue, 14 Jun 2011 10:55:06 +0200

On Tue, Jun 14, 2011 at 10:46 AM, Antonio Regidor García
<a_regidor_at_yahoo.es> wrote:

> Maybe the report should be more specific about the evaluation of (&).

I don't think it is necessary to specify a certain evaluation
strategy. Similar to lazy evaluation (which computes a result if there
is an arbitrary sequence of evaluation steps that does), the
evaluation of (a & b) could be required to fail in finite time if
there is an arbitrary interleaving of the evaluations of a and b that
does.

This specification would require termination for both definitions of partition.

Sebastian

_______________________________________________
curry mailing list
curry_at_lists.RWTH-Aachen.DE
http://MailMan.RWTH-Aachen.DE/mailman/listinfo/curry
Received on Tue Jun 14 2011 - 17:39:54 CEST

This archive was generated by hypermail 2.3.0 : Mon Sep 23 2019 - 07:15:08 CEST