#9374: Investigate Static Argument Transformation -------------------------------------+------------------------------------- Reporter: jstolarek | Owner: Type: task | Status: new Priority: lowest | Milestone: Component: Compiler | Version: 7.9 Resolution: | Keywords: Operating System: | Architecture: Unknown/Multiple Unknown/Multiple | Difficulty: Unknown Type of failure: | Blocked By: None/Unknown | Related Tickets: Test Case: | Blocking: | Differential Revisions: | -------------------------------------+------------------------------------- Changes (by simonpj): * cc: nicolas.frisby@… (added) Comment: That would be great. Quick thoughts * As I recall, in [http://research.microsoft.com/en- us/um/people/simonpj/papers/santos-thesis.ps.gz Andre Santos's thesis] he got ambiguous results from SAT: some programs improved, some got worse. * Also worth reading: Danvy et al's paper about "lambda-dropping" * The places it got worse might well be fixed by Nick Frisby's work on "late lambda lifting". Sadly, this has stalled a bit because Nick has got interested in other things. I'm copying him in the hope of an update. It would be great to re-instate SAT. But it would need someone to do some careful benchmarking to make sure that it yielded a net benefit. What usually happens is that you find a couple of cases where it makes things worse, investigate, find why, and modify the transformation to avoid them. Simon -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/9374#comment:1 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler