Re: residuation for compositional search?

From: Antonio Regidor García <>
Date: Tue, 14 Jun 2011 09:46:48 +0100 (BST)

--- El mar, 14/6/11, Sebastian Fischer <> escribió:

> 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.

But findall (\x -> partition [1,2,3] =:= x) terminates in one version but not in the other.

Anyway, I think it is a BAD THING that the termination of a program dependes on the compiler you use. Maybe the report should be more specific about the evaluation of (&).


Antonio Regidor García

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

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