[Haskell-cafe] Structural sharing in haskell data structures?

Andrew Wagner wagner.andrew at gmail.com
Tue May 12 18:02:09 EDT 2009

> Purity allows our data structures to have a lot of sharing.
> This is separate to laziness.

Ah, so haskell does do it. Interesting that it so rarely comes up, whereas
it's frequently mentioned in clojure.

> Laziness lets us build up interesting structures that have unusual
> sharing.
> Actually, what kind of persistant structures does Clojure have at this
> stage? I was under the impression they were reusing Java data
> structures. E.g. some of the nicer ones on hackage are zippers, patricia
> tries, finger trees, which I can't imaging have been ported.

It has some built-in persistent data structures: lists, vectors (arrays),
maps, and sets. It also has strong interoperability with Java, so that any
existing Java library can easily be used in Clojure code. In some ways, that
makes it a VERY mature language already.

> -- Don
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20090512/ce6cf377/attachment.html

More information about the Haskell-Cafe mailing list