Re:Announcing Rust 1.20
by wtetzner on Thursday August 31, 2017 @11:48PM
(#15145984)
Cyclic data structures can be created in Haskell, in large part due to laziness.
[ Parent
| on HN ]
Re:Announcing Rust 1.20
by lederhosen on Saturday September 02, 2017 @06:00PM
(#15158449)
If 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.