Remove TABs from examples

Removed trailing whitespace from all .sml and .sig files.

This affects over 900 files and was done using emacs's delete-trailing-whitespace
function in batch mode. Building the system with Poly/ML and Moscow ML seems to
work, so I'm hoping these changes don't break anything. Please complain if
they do!

Modification related to function calls. funCall was modified to get nested function calls working. As a result, mechReasoning had to be adapted to keep track of the modified parts of the stack. Additionally, function inlining at the IR level was implemented for non recursive functions.

Modified to allow "subprograms". Now it is for example possible to assign the value result of a complex if-then-else statement to a temporary variable. Thus, more complicated programs with complicated let expressions or nested conditional-executions can be handled now.

The representation of memory and access to memory was changed. Now memory is a map of 30 bit words to 32 bit words. Also the addressing of memory was changed to use just the upper 30 bit of the base register.

Merge between the portation to the new word-library / changes of IL and the new version checked in as TAR-file

changed VAR_CONV to handle MUL correctly and to exploit commutativity

The compiler has been ported to the new version of word-library. Additionally, the IL language has been adapted to be closer to ARM6 assembler.

changed Convert_CONV and VAR_LET_CONV to be able to handle constants better

Further updates to get things working for paired let bindings:

let (u,v) = M in N

Later phases in the compiler die on the results of this input ...

Small changes needed to make it compile.

Added "let" to the input language. Scott Owens noticed that

let v = M in N

can be mapped to

Seq (Par (\x.x) (\args. M)) (\(args,v). N)

so we don't have to add anything extra to get computation sharing via
lets. This should also transfer over to the hardware front-end I hope.
Now we can write

Round ((y,z),(k0,k1,k2,k3),s) =
let s' = s + DELTA in
let y' = ShiftXor(z, s', k0, k1)
in
((y', z + ShiftXor(y', s', k2, k3)), (k0,k1,k2,k3), s')

for TEA, which looks much nicer and produces 1/3 smaller code because we
no longer duplicate the expression abbreviated by y'.

*** empty log message ***

*** empty log message ***

*** empty log message ***

Trivial changes.

Simplified and improved the ANF generation.

Updates to accomodate Scott's new CPS_INTRO theorem.

Added a new "sw" directory for the software compiler being
written by Li, Owens, and Slind. This is a temporary hiding
place for work-in-progress.