[Haskell-cafe] tree insert and laziness

Daniel Trstenjak daniel.trstenjak at gmail.com
Sun Aug 17 07:58:41 UTC 2014

Hi Semen,

> If it is really the laziness that makes this approach efficient?

I don't think so, it's about the concrete implementation of immutable
data structures, that most of the data structure can be shared if only
one of it's elements gets changed.


More information about the Haskell-Cafe mailing list