summaryrefslogtreecommitdiff
path: root/compiler/specialise
diff options
context:
space:
mode:
authorGabor Greif <ggreif@gmail.com>2014-02-13 20:54:58 +0100
committerGabor Greif <ggreif@gmail.com>2014-02-13 20:54:58 +0100
commit3d80787f8bd76015fbbcc127204bddc670f93872 (patch)
treeeeda47fcbb235cebde65cd97dffb43a7234806f0 /compiler/specialise
parent347721659cb3abd8e8b0d7a4e5d56eb8ac62f3fe (diff)
downloadhaskell-3d80787f8bd76015fbbcc127204bddc670f93872.tar.gz
Fix some typos in comments
Diffstat (limited to 'compiler/specialise')
-rw-r--r--compiler/specialise/SpecConstr.lhs2
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/specialise/SpecConstr.lhs b/compiler/specialise/SpecConstr.lhs
index 060c705cda..86a56f4013 100644
--- a/compiler/specialise/SpecConstr.lhs
+++ b/compiler/specialise/SpecConstr.lhs
@@ -335,7 +335,7 @@ I wonder if SpecConstr couldn't be extended to handle this? After all,
lambda is a sort of constructor for functions and perhaps it already
has most of the necessary machinery?
-Furthermore, there's an immediate win, because you don't need to allocate the lamda
+Furthermore, there's an immediate win, because you don't need to allocate the lambda
at the call site; and if perchance it's called in the recursive call, then you
may avoid allocating it altogether. Just like for constructors.