This program is a simple tail recursive
implementation of
1 + 2 + 3 + 4 + ... + 1000000

The main point of interest is the use of re-evaluation
to keep the memory usage under control.

to make debugging feasible you will need to 
have a file Buddha/Main.opt with these contents:

   _ ; Suspect
   f ; ReEval

Be prepare to wait in between questions!
