On 7/11/07, Tony Finch <[EMAIL PROTECTED]> wrote:
Does anyone have references to a paper that discusses an optimisation like this for any language, not just Haskell?
Section 4.8 of "Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine." by Simon Peyton Jones, contains some references to papers about transformation to Continuation-Passing-Style. It also discusses the difference between CPS and the STG language: http://research.microsoft.com/users/simonpj/papers/spineless-tagless-gmachine.ps.gz regards, Bas van Dijk _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
