[commit: ghc] wip/callArityExprIsCheap: Typo in Call Arity notes (1cf987f)

[git at git.haskell.org]

Repository : ssh://git@git.haskell.org/ghc

On branch  : wip/callArityExprIsCheap
Link       : http://ghc.haskell.org/trac/ghc/changeset/1cf987f5df07297fa45655d5b372e9dbbbb7dcf0/ghc

>---------------------------------------------------------------

commit 1cf987f5df07297fa45655d5b372e9dbbbb7dcf0
Author: Joachim Breitner <mail at joachim-breitner.de>
Date:   Sun Dec 25 10:52:52 2016 +0100

    Typo in Call Arity notes


>---------------------------------------------------------------

1cf987f5df07297fa45655d5b372e9dbbbb7dcf0
 compiler/simplCore/CallArity.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/compiler/simplCore/CallArity.hs b/compiler/simplCore/CallArity.hs
index a93fe1f..3bd6a43 100644
--- a/compiler/simplCore/CallArity.hs
+++ b/compiler/simplCore/CallArity.hs
@@ -318,7 +318,7 @@ the analysis of `e2` will not report anything about `x`. To ensure that
 `callArityBind` does still do the right thing we have to take that into account
 everytime we would be lookup up `x` in the analysis result of `e2`.
   * Instead of calling lookupCallArityRes, we return (0, True), indicating
-    that this variable might be called many times with no variables.
+    that this variable might be called many times with no arguments.
   * Instead of checking `calledWith x`, we assume that everything can be called
     with it.
   * In the recursive case, when calclulating the `cross_calls`, if there is