45 | | 1. The R6RS implicitly requires that the implementation will be able to prove operational equivalence in ''all'' cases where there is no counterexample (which I suspect is not always possible), whereas my definition does not. My definition strictly requires `#t` for inexacts only when they have the "same internal representation". Therefore, my definition allows `#f` to be returned in some cases where R6RS would strictly require `#t`. |

| 45 | Even apart from the NaN problem [see #477 for details], my formulation has four notable changes: |

| 46 | |

| 47 | 1. The R6RS implicitly requires that the implementation will be able to prove operational equivalence in ''all'' cases where there is no counterexample (which I suspect is not always possible), whereas my definition does not. My definition strictly requires `#t` for inexacts only when they have the "same internal representation". Therefore, my definition allows `#f` to be returned in some cases where R6RS would strictly require `#t`. |