Re:Recursive fibonacci benchmark using top languages on GitHub
by vmchale on Friday September 28, 2018 @02:22PM
(#18095700)
Haskell is call-by-need so you get guarantees you wouldn't otherwise. It's not the same as memoization but it gives you what you want in any case.
[ Parent
| on HN ]
There are no comments on this comment yet.