[Haskell-cafe] Toy compression algorithms

Andrew Coppin andrewcoppin at btinternet.com
Thu Jul 12 14:06:52 EDT 2007

Thomas Conway wrote:
> On 7/12/07, Andrew Coppin <andrewcoppin at btinternet.com> wrote:
>> Yes - but making it use a non-flat model opens a whole Pandora's Box of
>> fiddly programming. ;-)
> This could just about be Rule No 1 of haskell programming: if it's
> fiddly, then you haven't thought about the problem hard enough.
> Corollary No 1 is Any Expression requiring more than 80 columns is 
> fiddly.
> :-)
> I say this in jest, but it is "ha ha, only serious".

LOL! Probably...

The idea behind PPM is very simple and intuitive. But working out all 
the probabilities such that they always sum to 100% is surprisingly 
hard. :-(

More information about the Haskell-Cafe mailing list