Hacker News Reader

> If a piece of code B loads the contents of memory where a piece of code A writes that's before B, then you can never execute B before or in parallel with A.

This is a description of what a data dependency is; I'm still not sure what your point is regarding mutable data structures specifically.

View on HN

A mutable data structure will have such data dependencies all around. An immutable data structure cannot, because it will never be written in after creation.

But an immutable data structure will cause data dependencies – the only way it couldn't cause a data dependency would be if it was never read.

But once it is created, all pieces of code accessing it can be executed in any order because there will never be a write on it again.

Reply on news.ycombinator.com