diff options
| author | David Terei <davidterei@gmail.com> | 2011-04-25 13:04:20 -0700 |
|---|---|---|
| committer | David Terei <davidterei@gmail.com> | 2011-04-26 14:17:15 -0700 |
| commit | 2deef658f811856c7e37edefef423758f5ffaca0 (patch) | |
| tree | 615f7fad76a263319c241e6bf6891f3383f686be /compiler/prelude | |
| parent | f84f86aed41e67039729adfb9095b71c07b7e938 (diff) | |
| download | haskell-2deef658f811856c7e37edefef423758f5ffaca0.tar.gz | |
Fix some small errors in comments
Diffstat (limited to 'compiler/prelude')
| -rw-r--r-- | compiler/prelude/PrelRules.lhs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/prelude/PrelRules.lhs b/compiler/prelude/PrelRules.lhs index b37556be12..8f2d21f364 100644 --- a/compiler/prelude/PrelRules.lhs +++ b/compiler/prelude/PrelRules.lhs @@ -54,7 +54,7 @@ Well, of course you'd need a lot of rules if you did it like that, so we use a BuiltinRule instead, so that we can match in any two literal values. So the rule is really more like - (Lit 4) +# (Lit y) = Lit (x+#y) + (Lit x) +# (Lit y) = Lit (x+#y) where the (+#) on the rhs is done at compile time That is why these rules are built in here. Other rules |