Re:Recursive fibonacci benchmark using top languages on GitHub
by Symmetry on Friday September 28, 2018 @10:36AM
(#18093701)
But is there any reason the Haskell compiler couldn't decide to memoize a function call itself if it determined that it would speed things up? To me that sounds hard for the compiler to do heuristically but a Haskell compiler should still have more scope to do optimizations like that than a C compiler has.
[ Parent
| on HN ]
There are no comments on this comment yet.