On Thu, 3 Oct 2002 19:16:09 -0400, Michael G Schwern wrote:
> On Thu, Oct 03, 2002 at 04:47:26PM -0500, Garrett Goebel wrote:
> > A derived interface can loosen input constraints... so it must be
> > able to either satisfy all inherited pre-conditions _or_ its own
> > pre-conditions.
>
> Looking around, this seems to be regarded as something of a compromise
> because truly determining what a real logical weaking is is hard.
That *is* a logical weakening. Just because the inherited precondition is
C<< x > 10 >>, doesn't mean that the weakened condition has to be of the form
C<< x > 9 >> or any other value lower than 10. C<< a || b >> is weaker than
C<< a >>
> Are there
> other ways to do it, just to mull them over?
--
Peter Haworth [EMAIL PROTECTED]
"I remember being impressed with Ada because you could write an infinite
loop without a faked up condition. The idea being that in Ada the
typical infinite loop would be normally be terminated by detonation."
-- Larry Wall
