On 2005-07-11 23:46, "Damian Conway" <[EMAIL PROTECTED]> wrote:
>     3. Work out the Manhattan distance from the argument list to each
>        variant's parameter list.

OK, sorry if I missed this in an earlier discussion.  For purposes of
calculating this Manhattan distance, I gather that we're treating lists of N
arguments/parameters as points in N-space.  I further assume that the
monoaxial distance between a parameter coördinate and the corresponding
argument coördinate - the distance between two types, where the types are
known to be assignment-compatible - is the number of inheritance steps
between them?

And one more dumb question: why is it that the L[1] metric is superior to
the L[2] metric for this purpose?

Reply via email to