4 ms·
Cyclic data structures can be created in Haskell, in large part due to laziness.
by wtetzner 9y ago
Cyclic data structures can be created in Haskell, in large part due to laziness.
- lederhosen 9y agoIf you see data structures as cyclic, it is not "in large part due to laziness", but _only_ due to laziness. If you look at the memory representation I think (but I am not sure) there will be no cycles between allocated objects. Only a thunk. Using strict data types, I think you agree that cycles can not be created. Non strict data structures I agree can be seen as cyclic, but I prefer seeing them as infinite.