On Sat, 21 Apr 2007, John Cowan wrote:
> Ben Harris scripsit:
>
> > This problem can be
> > dodged by having bitwise-bit-count return the number of set bits mod0
> > infinity, or more prosaically, by returning the number of set bits in
> > a non-negative argument, and _minus_ the number of clear bits in a
> > negative one.
>
> I think this is a good idea for the reasons given, but the phrase
> "mod0 infinity" should not be used, as Scheme has no exact infinity.
Indeed. That was intended to be a pseudo-mathemtical rationale for the
proposed arrangement, not proposed wording for the report.
--
Ben Harris
Received on Mon Apr 23 2007 - 18:41:28 UTC