4 ms·
If objects can't reference themselves, do you think recursion is impossible in Haskell? powersOf2 = 0 : scanl (+) 1 (tail powersOf2) fibonacci = 0 : s
by kccqzy 7y ago
If objects can't reference themselves, do you think recursion is impossible in Haskell?
powersOf2 = 0 : scanl (+) 1 (tail powersOf2)
fibonacci = 0 : scanl (+) 1 fibonacci
As I have already explained, immutable objects in Haskell often use laziness. And laziness requires mutability.