🚀 go-pugleaf

I have always been under the impression that lazy evaluation
makes it difficult to determine the time and space efficiency
of programs.  

If this is true, then it is a strong practical argument against using 
lazy evaluation, since asymptotic efficiency is quite important in
practice.   An O(n^2) algorithm may be unusable in practice, while
an O(n log n) algorithm may do quite nicely.

As a side note, it is sufficient to base the argument simply on
affecting asymptotic space complexity, since that affects the 
asymptotic time complexity of garbage collection.

It seems hard to argue that referential transparency is more
important to language design than the ability to predict the
algorithmic behavior of one's programs, given the fact that
a vast section of computer science is devoted to the study
of algorithms.

  -- David Tarditi