JHC itself is based upon Boquist's GRIN language described in his PhD
thesis: Code Optimization Techniques for Lazy Functional Languages
http://mirror.seize.it/papers/Code%20Optimization%20Techniques%20for%20Lazy%20Functional%20Languages.pdf
On 13 January 2012 01:50, Jason Dagit dag...@gmail.com
On 11/01/2012 15:20, Thomas Schilling wrote:
Based on your stated background, the best start would be the (longer)
paper on the Spineless Tagless G-machine [1].
Thanks for the tips. I haven't read much yet, but considering [1], I
guess I shouldn't have dismissed SPJs early 90's stuff so
On Tue, Jan 10, 2012 at 9:25 AM, Steve Horne
sh006d3...@blueyonder.co.uk wrote:
Also, what papers should I read? Am I on the right lines with the ones I've
mentioned above?
Thomas Schilling gave you a good response with papers so I will give
you a different perspective on where to look.
Most
On 1/12/12 8:50 PM, Jason Dagit wrote:
On Tue, Jan 10, 2012 at 9:25 AM, Steve Horne
sh006d3...@blueyonder.co.uk wrote:
Also, what papers should I read? Am I on the right lines with the ones I've
mentioned above?
Thomas Schilling gave you a good response with papers so I will give
you a
Based on your stated background, the best start would be the (longer)
paper on the Spineless Tagless G-machine [1]. It describes how graph
reduction is actually implemented efficiently. Since then there have
been two major changes to this basic implementation: Use of eval/apply
(a different
Although I'm far from being an expert Haskell programmer, I think I'm
ready to look into some of the details of how it's compiled. I've a copy
of Modern Compiler Design (Grune, Bal, Jacobs and Langendoen) - I first
learned a lot of lexical and parsing stuff from it quite a few years
ago.
