[Haskell-cafe] Byte Histogram

[Gábor Lehel]

On Thu, Mar 17, 2011 at 11:14 PM, Andrew Coppin
<andrewcoppin at btinternet.com> wrote:
>>> Right. So somebody else came up with an idea similar to mine, but since
>>> nobody could agree on anything more than a rough idea, nothing actually
>>> got
>>> done...(?)
>>
>> Well, I also got the sense that it would be more than a little
>> nontrivial to implement. Or at least, someone was talking about how it
>> would be a good topic for writing a thesis about if someone managed to
>> figure how to do it. I suspect that if someone were to actually put in
>> the effort they would be afforded the privilege of getting to nail
>> down the details. That's just completely baseless speculation, though.
>
> That sounds like a good description for just about every imaginable
> extension to Haskell that does something interesting! :-D

Turns out people *have* already written papers related to the topic.

Stefan Holdermans: Making Stricterness More Relevant
http://www.holdermans.nl/pubs/assets/holdermans10making-slides.pdf
http://www.holdermans.nl/pubs/assets/holdermans10making.pdf

Max Bolingbroke, Simon Peyton Jones: Types are Calling Conventions
http://www.cl.cam.ac.uk/~mb566/papers/tacc-hs09.pdf

The latter is particularly fascinating.

>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>



-- 
Work is punishment for failing to procrastinate effectively.