[commit: ghc] master: Fix comment (b7b3f01)

[git at git.haskell.org]

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

On branch  : master
Link       : http://ghc.haskell.org/trac/ghc/changeset/b7b3f017d3224e0ba960e9ba89cd885d9843fdef/ghc

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

commit b7b3f017d3224e0ba960e9ba89cd885d9843fdef
Author: Gabor Greif <ggreif at gmail.com>
Date:   Sat Jul 12 11:21:47 2014 +0200

    Fix comment


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

b7b3f017d3224e0ba960e9ba89cd885d9843fdef
 compiler/typecheck/TcTyDecls.lhs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/compiler/typecheck/TcTyDecls.lhs b/compiler/typecheck/TcTyDecls.lhs
index 31d522f..fcb8c03 100644
--- a/compiler/typecheck/TcTyDecls.lhs
+++ b/compiler/typecheck/TcTyDecls.lhs
@@ -264,7 +264,7 @@ this for all newtypes, we'd get infinite types.  So we figure out for
 each newtype whether it is "recursive", and add a coercion if so.  In
 effect, we are trying to "cut the loops" by identifying a loop-breaker.
 
-2.  Avoid infinite unboxing.  This is nothing to do with newtypes.
+2.  Avoid infinite unboxing.  This has nothing to do with newtypes.
 Suppose we have
         data T = MkT Int T
         f (MkT x t) = f t