summaryrefslogtreecommitdiff
path: root/compiler/GHC/Core/Opt/DmdAnal.hs
diff options
context:
space:
mode:
Diffstat (limited to 'compiler/GHC/Core/Opt/DmdAnal.hs')
-rw-r--r--compiler/GHC/Core/Opt/DmdAnal.hs4
1 files changed, 2 insertions, 2 deletions
diff --git a/compiler/GHC/Core/Opt/DmdAnal.hs b/compiler/GHC/Core/Opt/DmdAnal.hs
index d41b97ac87..c7278fa079 100644
--- a/compiler/GHC/Core/Opt/DmdAnal.hs
+++ b/compiler/GHC/Core/Opt/DmdAnal.hs
@@ -1186,7 +1186,7 @@ For example, if f's demand signature is <L><L>, f's arity could be
greater than, or less than 2. Why? Because both are conservative
approximations:
-* Arity n means "does no work until applied to at least n args"
+* Arity n means "does no expensive work until applied to at least n args"
(e.g. (f x1..xm) is cheap to bring to HNF for m<n)
* Dmd sig with n args means "here is how to transform the incoming demand
@@ -1197,7 +1197,7 @@ We used to check in GHC.Core.Lint that dmdTypeDepth <= idArity for a let-bound
identifier. But that means we would have to zap demand signatures every time we
reset or decrease arity.
-For example, consider the following expression, for example:
+For example, consider the following expression:
(let go x y = `x` seq ... in go) |> co