Definitions FTA Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Some definitions of interest.
commentDef  Kind of comment: $kind == a
eval_factorizationDef  {a..b}(f) ==  i:{a..b}. if(i)
Thm*  a,b:f:({a..b}). {a..b}(f 
int_segDef  {i..j} == {k:i  k < j }
Thm*  m,n:. {m..n Type
int_upperDef  {i...} == {j:ij }
Thm*  n:. {n...}  Type
iter_via_intsegDef  Iter(f;ui:{a..b}. e(i)
Def  == if a<b f((Iter(f;ui:{a..b-1}. e(i)),e(b-1)) else u fi
Def  (recursive)
Thm*  f:(AAA), u:Aa,b:e:({a..b}A). (Iter(f;ui:{a..b}. e(i))  A
natDef   == {i:| 0i }
Thm*    Type
notDef  A == A  False
Thm*  A:Prop. (A Prop
split_factor1Def  split_factor1(gx)(u)
Def  == if u=x g(x)+g(xx)+g(xx) ; u=xx 0 else g(u) fi
Thm*  k:{2...}, g:({2..k}), x:{2..k}.
Thm*  xx<k  split_factor1(gx {2..k}

About:
ifthenelseintnatural_numberaddsubtractmultiplyless_than
setlambdaapplyfunctionrecursive_def_notice
universememberpropimpliesfalseall!abstraction
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

Definitions FTA Sections DiscrMathExt Doc