> For example in Erlang the garbage collector can assume that only things with lower addresses point to things with higher adresses. Erlang gets it because it s

> For example in Erlang the garbage collector can assume that only things with lower addresses point to things with higher adresses. Erlang gets it because it says absolute no to mutation in the sequential functional part of the language. Haskell and Ocaml can't do that, they have escape hatches. Why does that matter? Does high-performance gabrage collecting depend on the ordering of objects in memory?