summaryrefslogtreecommitdiff
path: root/compiler/coreSyn
diff options
context:
space:
mode:
authorSimon Peyton Jones <simonpj@microsoft.com>2014-03-24 08:27:20 +0000
committerSimon Peyton Jones <simonpj@microsoft.com>2014-03-24 08:28:03 +0000
commit5c7ced0fd1bb67cadf9a7e5be112701bfcb4631b (patch)
treef64fa5c71cafb5190f10b49da053624c47d961fe /compiler/coreSyn
parenta8b7b28cdb98d14c6fb43d5ad3293fd4a5c1f8b4 (diff)
downloadhaskell-5c7ced0fd1bb67cadf9a7e5be112701bfcb4631b.tar.gz
Comments only
Diffstat (limited to 'compiler/coreSyn')
-rw-r--r--compiler/coreSyn/CoreSyn.lhs2
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/coreSyn/CoreSyn.lhs b/compiler/coreSyn/CoreSyn.lhs
index 47a993ed46..defd669a78 100644
--- a/compiler/coreSyn/CoreSyn.lhs
+++ b/compiler/coreSyn/CoreSyn.lhs
@@ -395,7 +395,7 @@ Here's another example:
f :: T -> Bool
f = \(x:t). case x of Bool {}
Since T has no data constructors, the case alternatives are of course
-empty. However note that 'x' is not bound to a visbily-bottom value;
+empty. However note that 'x' is not bound to a visibly-bottom value;
it's the *type* that tells us it's going to diverge. Its a bit of a
degnerate situation but we do NOT want to replace
case x of Bool {} --> error Bool "Inaccessible case"