LLL

[Raul Deluth Miller]

   There is one stack that I think we have to have; that is the return
   stack.  Please let me know if another solution exists.  

Well, one thing that comes to mind is the "Spineless, Tagless
G-machine" used in implementing one of the Haskell compilers.  Check
out the comp.lang.functional FAQ for the "Glasgow Haskell compiler".

[I hope I've spelled "Haskell" correctly...]

-- 
Raul D. Miller          N=:((*/pq)&|)@                 NB. public e, y, n=:*/pq
<rockwell@nova.umd.edu> P=:*N/@:#               NB. */-.,e e.&factors t=:*/<:pq
                        1=t|e*d    NB. (,-:<:)pq is four large primes, e medium
x-:d P,:y=:e P,:x                  NB. (d P,:y)-:D P*:N^:(i.#D)y [. D=:|.@#.d