Re: residuation for compositional search?

From: Sebastian Fischer <>
Date: Tue, 14 Jun 2011 10:31:12 +0200

On Tue, Jun 14, 2011 at 9:19 AM, Antonio Regidor García
<> wrote:

> Shouldn't (a & b) be semantically equivalent to (b & a)?

I think so.

In Curry, non-termination is semantically equivalent to failure, so if
an implementation manages to enumerate all solutions, it is (from a
semantics point of view) irrelevant whether it terminates afterwards.

I think, however, that it should be possible to keep the search space
finite for both versions of partition by blocking the evaluation of
shared expressions and resuming them when demanded by (=:=).


curry mailing list
Received on Di Jun 14 2011 - 17:39:53 CEST

This archive was generated by hypermail 2.3.0 : Mo Dez 04 2023 - 07:15:12 CET