🚀 go-pugleaf

In article <3462@rex.cs.tulane.edu> fs@rex.cs.tulane.edu (Frank Silbermann)
writes:
%Bjorn Lisper
%>	But there must be cases where some argument
%>	to a non-strict function has to be evaluated
%>	in order to determine what is to be done next,
%>	even in a lazy language. In all languages I've seen,
%>	lazy or not, this is done on a left to right basis.

%The theoretical justifications for purely leftmost evaluation
%were developed for in syntactic term-rewriting systems
%and also for the pure untyped lambda calculus.
%Many assume that the justifications carry over
%to more complicated languages.  This is not always true.

Which is quite the point I've been trying to make.

%>	The fact that leftmost-outermost reduction works
%>	for the lambda calculus (in the sense that this strategy
%>	will find the normal form of any lambda expression  
%>	which has one) is an uninteresting quirk ...  So,
%>	there's a problem with the very theoretical foundations
%>	of functional programming!

Whoa...you've merged a text I commented on with my comment! I didn't write
the text before the "..." above!

Bjorn Lisper