[Haskell-cafe] Optimizing hash array mapped tries

Bulat Ziganshin bulat.ziganshin at gmail.com
Wed Feb 24 14:48:53 EST 2010

Hello Edward,

Wednesday, February 24, 2010, 10:32:59 PM, you wrote:

> I'd be really curious about techniques that permit mutation during
> the construction of functional datastructures; this seems like a cool
> way to get fast performance w/o giving up any of the benefits of
> immutability.  Unfortunately, my (admittedly short) experiments in
> this domain ran up against the difficulty that vector didn't let me
> unsafely freeze its mutable version. :-)

actually, this technique is already used in haskell. look into array
library sources, search for freeze

Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com

More information about the Haskell-Cafe mailing list