Def if b t else f fi == InjCase(b ; t; f)

is mentioned by

Def fib(n) == if n=0  n=1 1 else fib(n-1)+fib(n-2) fi  (recursive)	[fib]
Def gcd(a;b) == if b=0 a else gcd(b;a rem b) fi  (recursive)	[gcd]

In prior sections: bool 1 int 2

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