Re: Encapsulated search does not encapsulate (all)non-determinism

From: Frank Steiner <fst_at_informatik.uni-kiel.de>
Date: Mon, 14 Jan 2002 13:45:55 +0100

Wolfgang Lux wrote:
 
> > This means that most search operators are no longer applicable.
>
> I'm not convinced. Do you have any other examples? The only problem I see
 
I haven't thought about any meaningful examples, but anyway, we could
not rely on a search operator encapsulating non-determinism anymore.
Thus, in case of I/O-based programs, we could not be sure that we always
avoid runtime errors due to non-determinism. In my mind, this would be
a major drawback. The fact that we might not see a good example at the
moment is not a big point. The situation might occur very fast when
one starts considering a special/new class of problems in Curry. From
my point of view, a solution where non-determinism is encapsulated
in *every* situation was preferrable. However, I don't see an easy solution
at the moment.

Best regards,
Frank

-- 
Dipl.-Inform. Frank Steiner        mailto:fst_at_informatik.uni-kiel.de
Lehrstuhl f. Programmiersprachen   mailto:fsteiner_at_web.de
CAU Kiel, Olshausenstraße 40       Phone: +49 431 880-7265, Fax: -7613
D-24098 Kiel, Germany              http://www.informatik.uni-kiel.de/~fst/
Received on Tue Jan 15 2002 - 06:46:17 CET

This archive was generated by hypermail 2.3.0 : Mon Sep 16 2019 - 07:15:04 CEST