Def f{m..n} == if nm nil else cons((f(m)); (f{(m+1)..n})) fi  (recursive)

is mentioned

In prior sections: list 1

Try larger context: HOLlib IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html