I feel that there is something that I don't understand completely: I have been told that Haskell does not memoize function call, e.g.<div>> slowFib 50</div><div>will run just as slowly each time it is called. However, I have read that Haskell has call-by-need semantics, which were described as "lazy evaluation with memoization"</div>
<div><br></div><div>I understand that</div><div>> fib50 = slowFib 50</div><div>will take a while to run the first time but be instant each subsequent call; does this count as memoization?</div><div><br></div><div>(I'm trying to understand "Purely Functional Data Structures", hence this question)<br clear="all">
<br>-- <br><div dir="ltr"><div> Alex R</div></div><br>
</div>