X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=docs%2Fusers_guide%2Fparallel.xml;fp=docs%2Fusers_guide%2Fparallel.xml;h=2f008ed6c4a311f96bc4aaeeee37bee3c8b31b0a;hb=cfdf2515dd5b491f8229d44b98fa33adeeac7e60;hp=4e864f35444bbde1829c31d981de605cbed86816;hpb=bfd7960566a3033182087a411016a04bd74f5eed;p=ghc-hetmet.git diff --git a/docs/users_guide/parallel.xml b/docs/users_guide/parallel.xml index 4e864f3..2f008ed 100644 --- a/docs/users_guide/parallel.xml +++ b/docs/users_guide/parallel.xml @@ -61,9 +61,9 @@ the FFI with concurrency. papers are an excellent introduction to what STM is, and how to use it. - The main library you need to use STM is - Control.Concurrent.STM. The main features supported are these: + The main library you need to use is the + stm library. The main features supported are these: Atomic blocks. Transactional variables. @@ -109,8 +109,8 @@ All these features are described in the papers mentioned earlier. One way to do so is forking threads using 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: + with) seq. Both of these are available from the parallel library: infixr 0 `par` @@ -177,8 +177,9 @@ nfib n | n <= 1 = 1 statistics; see . More sophisticated combinators for expressing parallelism are - available from the Control.Parallel.Strategies module. + available from the Control.Parallel.Strategies + module in the parallel package. This module builds functionality around par, expressing more elaborate patterns of parallel computation, such as parallel map.