[Haskell-cafe] ANN: bitspeak 0.0.1

Andrew Coppin andrewcoppin at btinternet.com
Tue Jun 22 13:24:22 EDT 2010

John Meacham wrote:
> In particular, a Huffman coding:
> http://en.wikipedia.org/wiki/Huffman_coding
> is ideal for this (assuming you just are taking advantage of frequency
> analysis). A dynamic Huffman Tree will even adapt as it is being used to
> whatever the current language is. Huffman Trees are easy and fun to
> implement too.

Interestingly, Huffman coding is one of those problems with a trivially 
simple mathematical expression, which none the less turns out to be 
difficult to express succinctly in Haskell. Oh, you can *do* it. It just 
seems to take a surprising amount of typing...

More information about the Haskell-Cafe mailing list