X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=docs%2Fusers_guide%2Fparallel.xml;h=96e4e56393052317dd58664e8699e855d08cb802;hb=f555abffd676544cd13d022bf1eb829e63f7aebe;hp=8b5abdbd4c949fa987d57be49dce3cfde78cb3e8;hpb=5263c9ab4408e3b62dbf7505ab40a81946d4e49b;p=ghc-hetmet.git diff --git a/docs/users_guide/parallel.xml b/docs/users_guide/parallel.xml index 8b5abdb..96e4e56 100644 --- a/docs/users_guide/parallel.xml +++ b/docs/users_guide/parallel.xml @@ -33,7 +33,7 @@ url="http://research.microsoft.com/copyright/accept.asp?path=/users/simonpj/papers/concurrent-haskell.ps.gz"> Concurrent Haskell paper is still an excellent resource, as is Tackling + url="http://research.microsoft.com/%7Esimonpj/papers/marktoberdorf/">Tackling the awkward squad. To the programmer, Concurrent Haskell introduces no new language constructs; @@ -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.