Closest Common Type

[Manfred Nowak]

BCS wrote:

> with a little insight from #D:
[...]

Would you please describe your (hopefully) real world case of usage.

I beg for this, because your algorithm has a worst case lower bound for 
the run time of
|   Omega( n * N)
and---if N is fixed---the fastet algorithm has a worst case lower bound 
for the runtime of
|   Omega( n + N);
where n is the number of queries to the derivation tree and N is the 
number of nodes in the derivation tree.

-manfred