git.haskell.org
/
ghc.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
b8b8d19
)
Fix comment
author
Gabor Greif
<ggreif@gmail.com>
Sat, 12 Jul 2014 09:21:47 +0000
(11:21 +0200)
committer
Gabor Greif
<ggreif@gmail.com>
Sat, 12 Jul 2014 15:59:06 +0000
(17:59 +0200)
compiler/typecheck/TcTyDecls.lhs
patch
|
blob
|
history
diff --git
a/compiler/typecheck/TcTyDecls.lhs
b/compiler/typecheck/TcTyDecls.lhs
index
31d522f
..
fcb8c03
100644
(file)
--- 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
i
s nothing to do with newtypes.
+2. Avoid infinite unboxing. This
ha
s nothing to do with newtypes.
Suppose we have
data T = MkT Int T
f (MkT x t) = f t