[Haskell-cafe] Re: Why can't Haskell be faster?
hughperkins at gmail.com
Sat Nov 3 07:44:46 EDT 2007
On Nov 3, 2007 5:00 AM, Ryan Dickie <goalieca at gmail.com> wrote:
> Lossless File compression, AKA entropy coding, attempts to maximize the
> amount of information per bit (or byte) to be as close to the entropy as
> possible. Basically, gzip is measuring (approximating) the amount of
> "information" contained in the code.
Hmmm, interesting idea.
> I think it would be interesting to compare the ratios between raw file size
> its entropy (we can come up with a precise metric later). This would show us
> how concise the language and code actually is.
Yeah, let's all write in bytecode using a hex editor :-D
More information about the Haskell-Cafe