4 ms·
This claim confuses me. It's eager, not lazy. And judging from the video presentation, where an incorrect[1] binary search results in a stack overflow, it doesn
by reycharles 11y ago
This claim confuses me. It's eager, not lazy. And judging from the video presentation, where an incorrect[1] binary search results in a stack overflow, it doesn't have proper tail calls either. This doesn't suggest to me that it derives from Haskell at all.
[1]: The lower bound wasn't updated correctly which should made it loop indefinitely.
- reycharles 11y agoJust confirmed, calling (loop) will cause a stackoverflow. You'd expect TCO for a Lisp and proper tail calls for a Haskell-derived langauge. loop (fn [] (loop))
- deleted 11y ago[deleted]