Def i<j == if i<j true ; false fi

is mentioned by

Def count(x < y in L | P(x;y)) Def == sum(if (i<j)P(L[i];L[j]) 1 else 0 fi | i < ||L||; j < ||L||)

[count_pairs]

In prior sections: bool 1 sqequal 1 list 1 mb nat mb list 1

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