diff options
| author | Gabor Greif <ggreif@gmail.com> | 2017-07-20 10:46:14 +0200 |
|---|---|---|
| committer | Gabor Greif <ggreif@gmail.com> | 2017-07-20 10:47:47 +0200 |
| commit | a273c735ca268988ee1550c248ba88b57a227cb9 (patch) | |
| tree | 29cc527b94f2f6efcf4343659ba7234fec0a1dd2 /compiler/simplCore/Simplify.hs | |
| parent | cc839c57ff9c80b50d39e8e2e66a18674bab3486 (diff) | |
| download | haskell-a273c735ca268988ee1550c248ba88b57a227cb9.tar.gz | |
Spelling fixes
Diffstat (limited to 'compiler/simplCore/Simplify.hs')
| -rw-r--r-- | compiler/simplCore/Simplify.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/simplCore/Simplify.hs b/compiler/simplCore/Simplify.hs index 8bccbfef54..91ed644057 100644 --- a/compiler/simplCore/Simplify.hs +++ b/compiler/simplCore/Simplify.hs @@ -1865,7 +1865,7 @@ latter's strictness when simplifying e2, e3. Moreover, suppose we have Then given (f Int e1) we rewrite to (\x. x True) e1 -without simpifying e1. Now we can inline x into its unique call site, +without simplifying e1. Now we can inline x into its unique call site, and absorb the True into it all in the same pass. If we simplified e1 first, we couldn't do that; see Note [Avoiding exponential behaviour]. |