Hi Tomas,
thinking about it, I probably wrote nonsense yesterday:
> If you have a function 'rankClass' which returns the depth where a class
> in the hierarchy is located
>
>(de rankClass (Cls)
> ...
The depth does not matter, right?
Instead, the top-level base classes must be compared (yo
Hi Tomas,
> As the list being sorted is finite, it must be possible to come up
> with a unary weighting function. The question is whether the unary
> function is always "better" then the binary predicate?
I do believe so. The unary function is simpler (as you see from the
previous examples), and
