summaryrefslogtreecommitdiff
path: root/compiler/prelude
diff options
context:
space:
mode:
authorsven.panne@aedion.de <unknown>2007-03-14 15:15:17 +0000
committersven.panne@aedion.de <unknown>2007-03-14 15:15:17 +0000
commit87ebda2011a8ef511b14d96728f01c419e5bb665 (patch)
tree42bc70a24afdb6e35b3ab1a03e60f535e4ac6688 /compiler/prelude
parent01eb02c3392ff9acb5e4207f2633776ad6b8780d (diff)
downloadhaskell-87ebda2011a8ef511b14d96728f01c419e5bb665.tar.gz
Unbreak Haddock markup
Diffstat (limited to 'compiler/prelude')
-rw-r--r--compiler/prelude/primops.txt.pp2
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/prelude/primops.txt.pp b/compiler/prelude/primops.txt.pp
index 8d9bbc8b83..e8b85ab693 100644
--- a/compiler/prelude/primops.txt.pp
+++ b/compiler/prelude/primops.txt.pp
@@ -1794,7 +1794,7 @@ pseudoop "lazy"
{\tt par :: a -> b -> b}
- {\tt par x y = case (par\# x) of \{ \_ -> lazy y \}}
+ {\tt par x y = case (par\# x) of \_ -> lazy y x}
If {\tt lazy} were not lazy, {\tt par} would look strict in {\tt y} which
would defeat the whole purpose of {\tt par}.