X-Git-Url: http://git.megacz.com/?p=ghc-hetmet.git;a=blobdiff_plain;f=docs%2Fusers_guide%2Fparallel.xml;h=242ba2248e4a465ecb30b1abca110d9726f8bc0b;hp=8b5abdbd4c949fa987d57be49dce3cfde78cb3e8;hb=3454afa0f32053cf4b06e25f93c36c0612a9d944;hpb=8612b9a9f60161f65e656f65df8b679008911b3a
diff --git a/docs/users_guide/parallel.xml b/docs/users_guide/parallel.xml
index 8b5abdb..242ba22 100644
--- a/docs/users_guide/parallel.xml
+++ b/docs/users_guide/parallel.xml
@@ -110,7 +110,7 @@ All these features are described in the papers mentioned earlier.
linkend="concurrent-haskell"/>), but the simplest mechanism for extracting parallelism from pure code is
to use the par combinator, which is closely related to (and often used
with) seq. Both of these are available from Control.Parallel:
+ url="../libraries/parallel/Control-Parallel.html">Control.Parallel:
infixr 0 `par`
@@ -163,7 +163,7 @@ nfib n | n <= 1 = 1
More sophisticated combinators for expressing parallelism are
available from the Control.Parallel.Strategies module.
+ url="../libraries/parallel/Control-Parallel-Strategies.html">Control.Parallel.Strategies module.
This module builds functionality around par,
expressing more elaborate patterns of parallel computation, such as
parallel map.