Definitions list 1 Sections StandardLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Some definitions of interest.
int_segDef {i..j} == {k:i  k < j }
Thm* m,n:. {m..n Type
lengthDef ||as|| == Case of as; nil  0 ; a.as'  ||as'||+1  (recursive)
Thm* A:Type, l:A List. ||l||  
Thm* ||nil||  
listifyDef f{m..n} == if nm nil else f(m).f{(m+1)..n} fi  (recursive)
Thm* T:Type, m,n:f:({m..n}T). f{m..n T List
selectDef l[i] == hd(nth_tl(i;l))
Thm* A:Type, l:A List, n:. 0n  n<||l||  l[n A
tlambdaDef (x:Tb(x))(x) == b(x)

About:
listconsnillist_ind
ifthenelseintnatural_numberaddless_thansetapply
functionrecursive_def_noticeuniversememberimpliesall
!abstraction
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

Definitions list 1 Sections StandardLIB Doc