|Optimizing IEEE Floating-Point Operations bill@hcx2.SSD.CSD.HARRIS.COM (1991-06-14)|
|INFs and NaNs firstname.lastname@example.org (1991-06-17)|
|Re: INFs and NaNs email@example.com (1991-06-18)|
|From:||firstname.lastname@example.org (David Presberg)|
|In-Reply-To:||email@example.com's message of 17 Jun 91 19:03:50 GMT|
|Date:||Tue, 18 Jun 91 13:49:18 EDT|
In article 91-06-024 firstname.lastname@example.org writes:
> ... I seem to recall that the folks working on dataflow architectures
> rigorously defined the math for propogating error values so that traps,
> etc., would not be necessary. I don't recall the author but I believe the
> title of the paper was Error Values in Val.
Try "VAL -- A Value-Oriented Algorithmic Language: Preliminary Reference
Manual", William B. Ackerman, Jack B. Dennis, MIT/LCS/TR 218, June 13, 1979.
There are probably more recent articles or tech. reports on the language.
Careful attention is given to the behavior of all forms of computational
(e.g., "undef" operands of an operator, "miss_elt" -- missing component --
of an array object), and arithmetic errors (e.g., there are 20 rules for
errors in integer operations alone, more for reals).
David L. Presberg, Compass, Inc.
Return to the
Search the comp.compilers archives again.