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/specialise/Rules.hs | |
| parent | cc839c57ff9c80b50d39e8e2e66a18674bab3486 (diff) | |
| download | haskell-a273c735ca268988ee1550c248ba88b57a227cb9.tar.gz | |
Spelling fixes
Diffstat (limited to 'compiler/specialise/Rules.hs')
| -rw-r--r-- | compiler/specialise/Rules.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/specialise/Rules.hs b/compiler/specialise/Rules.hs index aed86c5b42..b5606754e6 100644 --- a/compiler/specialise/Rules.hs +++ b/compiler/specialise/Rules.hs @@ -617,7 +617,7 @@ bound on the LHS: RULE forall (c :: a~b). f (x |> c) = e Now, if that binding is inlined, so that a=b=Int, we'd get RULE forall (c :: Int~Int). f (x |> c) = e - and now when we simpilfy the LHS (Simplify.simplRule) we + and now when we simplify the LHS (Simplify.simplRule) we optCoercion will turn that 'c' into Refl: RULE forall (c :: Int~Int). f (x |> <Int>) = e and then perhaps drop it altogether. Now 'c' is unbound. |