Def  Iter(f;u) i:{a..b}. e(i)
Def  == if a<b f(Iter(f;u) i:{a..b-1}. e(i),e(b-1)) else u fi
Def  (recursive)

is mentioned

In prior sections: IteratedBinops DiscreteMath FTA

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html