[Haskell-cafe] Toy compression algorithms [was: A very edgy
language]
Bulat Ziganshin
bulat.ziganshin at gmail.com
Sun Jul 8 14:40:10 EDT 2007
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 :)
--
Best regards,
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe
mailing list