Re: [Scheme-reports] EQV? on numbers should be based on operational equivalence
John Cowan 09 May 2012 03:59 UTC
Per Bothner scripsit:
> Why? If two number written out to bytevectors (or binary files in general)
> have different bit-patterns, they're not operationally equivalent, and
> they're not eqv?. What is the problem?
*shrug*
By the same token, two numbers that are = and have the same exactness,
but aren't EQ?, shouldn't be operationally equivalent either -- which means
EQV? reduces to EQ?. There have to be boundaries drawn somewhere.
--
Almost all theorems are true, John Cowan <cowan@ccil.org>
but almost all proofs have bugs. http://www.ccil.org/~cowan
--Paul Pedersen
_______________________________________________
Scheme-reports mailing list
Scheme-reports@scheme-reports.org
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports