Originally, we wanted to only use binary ones, at least initially. But this
would a lot of fiddling with selectors when converting to/from generic
array representations. This is both inefficient and hard to implement.
Instead, we will limit the arity of our sums/product representation to, say,
16 (it's 3 at the moment) and initially refuse to vectorise programs for which
this is not sufficient. This allows us to implement everything in the library.
Later, we can implement the necessary splitting.

The paths can also now be overridden with the standard configure flags
--docdir=, --htmldir= etc. We were always advertising these, but now we
actually obey them.

While I was there I removed some trailing white space

Test is print025

Remnants of :stepover

This documentation was just duplicating what is in GHC.Prim now.

The C-- parser was missing the "stdcall" calling convention for
foreign calls, but once added we can call {Enter,Leave}CricialSection
directly.

- The type families patch includes a change to darcs-all that breaks it for
  ssh repos at least for Perl 5.8.8 (on MacOS).
- My Perl-fu is not sufficient to try to fix the modification, which was
  supposed to improve darcs-all on windows, so I just revert to the old
  code.

 :stepover is declared a failed experiment. 
:steplocal steps only on ticks contained in the current
top level declaration. 
:stepmodule steps only on ticks contained on the current
 module. 
The current top level declaration and module are with
 respect to the breakpoint we are stopped on.

 The main reason for the failure of :stepover
(apart from lacking a lexical call stack of course)
is that it fails to detect when the expression being 
evaluated is "complete", i.e. there are no ticks left in it.
My assumption of the rightmost tick as the "last one",
signaling that the expression is completely evaluated,
is not true at all under laziness. 
This assumption was key in the implementation of :stepover.
 

when printing the contents of binding at a breakpoint