summaryrefslogtreecommitdiff
path: root/compiler/simplCore/Simplify.lhs
diff options
context:
space:
mode:
authorRoman Leshchinskiy <rl@cse.unsw.edu.au>2009-11-04 14:28:36 +0000
committerRoman Leshchinskiy <rl@cse.unsw.edu.au>2009-11-04 14:28:36 +0000
commitc01e472e205f09e6cdadc1c878263998f637bc8d (patch)
tree89391f959d86f90ccb4f3c17b031fae69bca2d8f /compiler/simplCore/Simplify.lhs
parentd10fa3041959b3e05a4718ff9d1ab8201d1d591e (diff)
downloadhaskell-c01e472e205f09e6cdadc1c878263998f637bc8d.tar.gz
Consider variables with conlike unfoldings interesting
In this expression: let x = f (g e1) in e2 the simplifier will inline f if it thinks that (g e1) is an interesting argument. Until now, this was essentially the case if g was a data constructor - we'd inline f in the hope that it will inspect and hence eliminate the constructor application. This patch extends this mechanism to CONLIKE functions. We consider (g e1) interesting if g is CONLIKE and inline f in the hope that this will allow rewrite rules to match.
Diffstat (limited to 'compiler/simplCore/Simplify.lhs')
0 files changed, 0 insertions, 0 deletions