[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

This page is part of the web mail archives of SRFI 67 from before July 7th, 2015. The new archives for SRFI 67 contain all messages, not just those from before July 7th, 2015.

*To*: srfi-67@xxxxxxxxxxxxxxxxx*Subject*: IEEE 754 floating-point arithmetic is not completely ordered*From*: Bradley Lucier <lucier@xxxxxxxxxxxxxxx>*Date*: Tue, 12 Apr 2005 11:15:10 +0200*Delivered-to*: srfi-67@xxxxxxxxxxxxxxxxx*Old-date*: Mon, 11 Apr 2005 22:20:14 -0500*User-agent*: Gnus/5.110002 (No Gnus v0.2) XEmacs/21.5 (chives, berkeley-unix)

In IEEE 754 floating-point arithmetic, if x is NaN then none of x < y, x=y, or x>y is true for any y (not even x=x). How do you propose to implement compare-real? You say sign(x-y) is computed, but this may not have a consistent definition if x or y is a NaN. You give an example involving PLT 208 and coercion of an exact real part to inexact because of an inexact imaginary part. You might note that other Scheme implementations may not require or implement this coercion. Brad Lucier

- Prev by Date:
**Re: Relation to sorting, checks, typos** - Next by Date:
**Re: IEEE 754 floating-point arithmetic is not completely ordered** - Previous by thread:
**Re: Relation to sorting, checks, typos** - Next by thread:
**Re: IEEE 754 floating-point arithmetic is not completely ordered** - Index(es):