Re: curry on windows (was: encapsulated search)

From: Michael Hanus <mh_at_informatik.uni-kiel.de>
Date: Fri, 11 May 2007 18:27:59 +0200

Claus Reinke wrote:
> assuming standard (normal-order) definitions of normal form (nf),
> head nf (hnf), weak hnf (whnf), the typical reduction to whnf
> reduces less than it could, but any reduction beyond hnf, towards
> full nf, implies reductions that might not be needed in context.
> what is the rationale for this unusual choice?

Could you provide a reference to a "standard" definition of
normal form? The current handling of normal form comes
from the area of term rewriting (which is somehow the basis of Curry)
where a term is in normal form if it does not contain a redex.
This implies reductions at arbitrary places.
On the other hand, the notion of normal form is not really defined
in the Curry report so that it is more or less a question of
the various implementations what they show the user at the top level.

Best regards,

Michael

_______________________________________________
curry mailing list
curry_at_lists.RWTH-Aachen.DE
http://MailMan.RWTH-Aachen.DE/mailman/listinfo/curry
Received on Mon May 14 2007 - 08:49:55 CEST

This archive was generated by hypermail 2.3.0 : Thu Sep 19 2019 - 07:15:07 CEST