[Haskell-cafe] ANN: A Functional Implementation of the Garsia-Wachs
nicolas.pouillard at gmail.com
Tue Sep 23 02:15:36 EDT 2008
Here is an Haskell implementation of an algorithm that builds a binary tree with
minimum weighted path length from weighted leaf nodes given in symmetric order.
This can be used to build optimum search tables, to balance a
'ropes' data structure in an optimal way.
This module a direct translation from OCaml of a functional pearl
by Jean-Christophe Filliâtre yesterday on ML Workshop 2008.
There was an interesting point to porting it to Haskell, indeed there is a
crucial use of first-class references used only locally. A good reason to
show the power of the ST monad and it's runST function!
Here is the hackage URL:
And the darcs 2 URL:
Nicolas Pouillard aka Ertai
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 194 bytes
Desc: not available
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20080922/f36af8a2/signature.bin
More information about the Haskell-Cafe