🚀 go-pugleaf

In article <3737@svin02.info.win.tue.nl> erik@win.tue.nl writes:
>david@gdstech.grumman.com (David Nettles) writes:
>
>	Lazy evaluation does indeed save time by not evaluating arguments
>	that are not needed. However, eager evaluation saves times by never
>	evaluating the same argument twice.
>	In eager languages, all arguments are evaluated ONCE,
>	regardless of whether they are actually needed.

This assumes implementation via string reduction.
With string reduction, lazy programs execute very slowly.
(Did somebody mention the speed of continental drift?) :-)

With graph reduction, lazy evaluation means evaluation _at most_ once.
The challenge of laziness is to find a way to implement graph
reduction without imposing a large constant-factor overhead.
------------------------------------------
Frank Silbermann	fs@cs.tulane.edu
Tulane University	New Orleans, Louisiana  USA