On Mon, Jun 26, 2017 at 10:41 PM, William D Clinger <xxxxxx@ccs.neu.edu> wrote:

In the spec for bitwise-fold, I assume "For each bit b of i from bit #0
to bit (integer-length i)" is exclusive of (integer-length i).  Otherwise
the example is wrong.

Yes, that's the intention.
 
The example for bitwise-for-each is wrong because that procedure's return
value is unspecified.  I also assume "starting with bit #0 and ending with
bit (integer-length i)" is exclusive of (integer-length i).

That's the intention too.  I've fixed the example.
 
Although the draft SRFI says make-bitwise-generator accepts an optional
second argument, it says nothing about the semantics of that argument.
I suspect the optional second argument specifies some number of low-order
bits to ignore.

No, it's a copy-paste error, and was also present in SRFI 142. Removed.
 
The prototype for bits->list says it accepts only one argument, but some
of the examples have that procedure accepting a second argument.

I've removed those examples.
 
According to the draft SRFI, the first argument to bits->list must be
non-negative.  That means test-227 in chibi-test.scm is incorrect.

Test removed.
 
-- 
John Cowan          http://vrici.lojban.org/~cowan        xxxxxx@ccil.org
Income tax, if I may be pardoned for saying so, is a tax on income.
                --Lord Macnaghten (1901)