Indicates that it may be beneficial to evaluate the first argument in parallel with the second. Returns the value of the second argument.
a is exactly equivalent semantically to
par is generally used when the value of
a is likely to be
required later, but not immediately. Also it is a good idea to
a is not a trivial computation, otherwise the cost of
spawning it in parallel overshadows the benefits obtained by
running it in parallel.
Note that actual parallelism is only supported by certain
implementations (GHC with the
-threaded option, and GPH, for
now). On other implementations,
par a b = b.
Semantically identical to
seq, but with a subtle operational
seq is strict in both its arguments, so the compiler
may, for example, rearrange
This is normally no problem when using
seq to express strictness,
but it can be a problem when annotating code for parallelism,
because we need more control over the order of evaluation; we may
want to evaluate
b, because we know that
already been sparked in parallel with
This is why we have
pseq. In contrast to
pseq is only
strict in its first argument (as far as the compiler is concerned),
which restricts the transformations that the compiler can do, and
ensures that the user can retain control of the evaluation order.
seq :: a -> b -> b
Evaluates its first argument to head normal form, and then returns its second argument as the result.