Def primrec(n;b;c) == if n=0 b else c(n-1,primrec(n-1;b;c)) fi  (recursive)

is mentioned by

Thm* n:, h,f:(TT). f^n o h = primrec(n;h;i,g. f o g)	[fun_exp_compose]
Thm* n,m:, b:T, c:((n+m)TT). Thm* primrec(n+m;b;c) = primrec(n;primrec(m;b;c);i,t. c(i+m,t))	[primrec_add]
Def search(k;P) == primrec(k;0;i,j. if 0<j j ; P(i) i+1 else 0 fi)	[search]
Def f^n == primrec(n;x.x;i,g. f o g)	[fun_exp]
Def sum(f(x) | x < k) == primrec(k;0;x,n. n+f(x))	[sum]

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