Re: New limited range type?

["Martin Dowie" <martin.dowie@btopenworld.com>]

"Larry Hazel" <lhhazel@otelco.net> wrote in message
news:l%Sqb.1767$X5.22782@eagle.america.net...
> > You could argue that the case "A := B + C - D," for these 'limited
> > range' types _can_only_ be equivilent to "A := (B + C) - D;".
> >
> An analog computer implements saturating arithmetic.  Oh my God, how
> long has it been since anyone saw an analog computer.  The sum B + C - D
> would be computed all at once and would only saturate if the final
> result was out of range.  So, I think the expression should be evaluated
> in a base type with saturation applied to the result.

or, how about lets not and support the 99.99999999999999999999999etc%
digital world only! :-)

Is there an Ada (any variant) compiler for an analogue computer?..