diff options
| author | Gabor Greif <ggreif@gmail.com> | 2014-07-12 11:21:47 +0200 |
|---|---|---|
| committer | Gabor Greif <ggreif@gmail.com> | 2014-07-12 17:59:06 +0200 |
| commit | b7b3f017d3224e0ba960e9ba89cd885d9843fdef (patch) | |
| tree | 28f2b016d86e692c70758dba8bef990563d71606 | |
| parent | b8b8d190525b073aa44f7a5bda555e25ea7ef5d6 (diff) | |
| download | haskell-b7b3f017d3224e0ba960e9ba89cd885d9843fdef.tar.gz | |
Fix comment
| -rw-r--r-- | compiler/typecheck/TcTyDecls.lhs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/typecheck/TcTyDecls.lhs b/compiler/typecheck/TcTyDecls.lhs index 31d522fdeb..fcb8c0336c 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 |