Some definitions of interest.
fun_exp	Def f^n == primrec(n;x.x;i,g. f o g)
	Thm* T:Type, n:, f:(TT). f^n  TT
nat	Def  == {i:| 0i }
	Thm*   Type
primrec	Def primrec(n;b;c) == if n=0 b else c(n-1,primrec(n-1;b;c)) fi  (recursive)
	Thm* T:Type, n:, b:T, c:(nTT). primrec(n;b;c)  T
top	Def Top == Void given Void
	Thm* Top  Type

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