[Haskell-cafe] Toy compression algorithms [was: A very edgy language]

[Stefan O'Rear]

On Sun, Jul 08, 2007 at 10:40:10PM +0400, Bulat Ziganshin wrote:
> Hello Andrew,
> 
> Sunday, July 8, 2007, 7:12:38 PM, you wrote:
> >>> (Realistically though. My program takes a [Word8] and turns it into a
> >>> [Bool] before running a parser over it. The GHC optimiser doesn't really 
> >>> stand a hope in hell of optimising that into a program that reads a machine 
> >>> word into a CPU register and starts playing with bit flips on it...)
> >>>     
> >>
> >> Actually, if you're very lucky (fusion is just as hard in Haskell as it
> >> is in real life), it *does*.  It seems to fit nicely into the
> >> stream-fusion framework.
> >>   
> 
> > Ooo... really? That's pretty impressive...(!)
> 
> it's our collective tale for bringing new haskellers. i bet that
> Stefan never seen asm code generated by ghc :)

If you check the list archives, you'll see that I've been a major
contributer to quite a few threads on the GHC code generator, and I
posted to the JHC list months ago.

Also, I said it would be read into a register, I never said it wouldn't
be spilled two instructions later ;)

Stefan (If I'm taking this totally wrong, make sure I know)