Def		tree_node(<x, y>)	[node]
Def		t_iterate(l;n;t)	[t_iterate]
Def		left_child(t)	[left_child]
Def		right_child(t)	[right_child]
Def		leaf_value(t)	[leaf_value]
Def		Tree(E)	[tree]
Def		x:A. B(x)	[all]	core
Def		S  T	[subtype]	core
Def		tree_leaf(x)	[tree_leaf]
Def		is_leaf(t)	[is_leaf]
Def			[bool]	bool 1
Def		b	[assert]	bool 1
Def		P  Q	[implies]	core
Def		tree_con(E;T)	[tree_con]
Def		tree_node(x)	[tree_node]
Def		True	[true]	core
Def		Default => body	[case_default]	prog 1
Def		Case tree_leaf(x) => Casebody(x) cont	[case_tree_leaf]
Def		Case x;y => Casebody(x;y) cont	[case_node]
Def		Case(value) body	[case]	prog 1
Def		Y	[ycomb]	core
Def		false	[bfalse]	bool 1
Def		true	[btrue]	bool 1

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