From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | Peter Eisentraut <peter_e(at)gmx(dot)net> |
Cc: | Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: type conversion discussion |
Date: | 2000-05-19 03:46:13 |
Message-ID: | 6230.958707973@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Peter Eisentraut <peter_e(at)gmx(dot)net> writes:
>> I don't think so. The lattice property only says that the set A has a
>> glb within the equivalence class. AFAICT it doesn't promise that the
>> glb will be >= Q, so you can't necessarily use the glb as the function
>> to call.
> Since all functions in A are >=Q by definition, Q is at least _a_ lower
> bound on A. The glb(A) is also a lower bound on A, and since it's the
> greatest it must also be >=Q.
No, you're not catching my point. glb(A) is the greatest lower bound
*within the set of available functions*. Q, the requested call
signature, is *not* in that set (if it were then we'd not have any
ambiguity to resolve, because there's an exact match). The fact that
the set of available functions forms a lattice gives you no guarantee
whatever that glb(A) >= Q, because Q is not constrained by the lattice
property.
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2000-05-19 03:51:22 | Re: AW: type conversion discussion |
Previous Message | Peter Eisentraut | 2000-05-19 03:43:53 | Re: type conversion discussion |