summaryrefslogtreecommitdiff
path: root/compiler/utils/Pretty.lhs
diff options
context:
space:
mode:
authorMichael D. Adams <t-madams@microsoft.com>2007-05-14 12:12:31 +0000
committerMichael D. Adams <t-madams@microsoft.com>2007-05-14 12:12:31 +0000
commit7c085edd732bd1fd52e758017da9eac583bfba1a (patch)
treedc5c9b3e1a14e26e1d07ddfdbc91fea288a96d58 /compiler/utils/Pretty.lhs
parent2fa6c5f24fac978075fd903b43c39a29ee060dc8 (diff)
downloadhaskell-7c085edd732bd1fd52e758017da9eac583bfba1a.tar.gz
Typo fix in a comment.
Diffstat (limited to 'compiler/utils/Pretty.lhs')
-rw-r--r--compiler/utils/Pretty.lhs2
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/utils/Pretty.lhs b/compiler/utils/Pretty.lhs
index 5973998150..96ea1fbfc5 100644
--- a/compiler/utils/Pretty.lhs
+++ b/compiler/utils/Pretty.lhs
@@ -87,7 +87,7 @@ Relative to John's original paper, there are the following new features:
It is Really Useful in practice.
2. There is a paragraph-fill combinator, fsep, that's much like sep,
- only it keeps fitting things on one line until itc can't fit any more.
+ only it keeps fitting things on one line until it can't fit any more.
3. Some random useful extra combinators are provided.
<+> puts its arguments beside each other with a space between them,