🚀 go-pugleaf

In article <DBH.92Jul23152442@wombat.doc.ic.ac.uk> dbh@doc.ic.ac.uk (Denis Howe) writes:

   Have the Gabriel benchmarks been translated into a functional
   language?  I am thinking of translating them from Scheme to Haskell.
   --
   Denis Howe <dbh@doc.ic.ac.uk>
   Does this question have an answer?


Francis Dupont of INRIA has translated some of the Gabriel benchmarks
in a lazy variant of CAML. He found that, eg, the Boyer test program
was running faster in lazy mode than in eager mode, because most of
the lists it creates do not get used! 

Feel free to consider this a proof that lazyness is superior to
eagerness <8^]. IMO this is at best a proof that benchmarks are often
meaningless.

	Vincent