Hi.  Last minute comments:

In the rationale section: This version no longer contains procedures from Gauche's data.random, I think.
If it's correct, you can drop the reference to it.

make-iota-generator  and make-range-generator: It may be obvious, but maybe helpful to explicitly tell
the conditions that returned numbers becomes inexact, e.g. "If both start and step are exact, it generates 
exact numbers; otherwise it generates inexact numbers.  The exactness of count/end doesn't affect the 
exactness of the results."
(The last condition is useful to give +inf.0 for count/end)

About Authors: Originally I saw text lifted from Gauche manual, but now they are mostly rewritten
by John.  It's up to John, but I'm ok about any order of authors.

On Mon, Oct 19, 2015 at 1:46 PM, John Cowan <xxxxxx@mercury.ccil.org> wrote:
The latest draft of SRFI 121 is now posted to
<http://www.ccil.org/~cowan/temp/srfi-121.html>.  The implementation
resides at <http://www.ccil.org/~cowan/temp/generators.tar.gz>.
Please pull both files to srfi.schemers.org.

The following changes were made since the last draft:

Add back make-iota-generator to provide a finite generator with a fixed
count and optional start and step.

Flushed grepeat*, gsubgenerators, ggroup-by operators as unnecessary.

Flushed all syntax extensions.

Modified the implementation to conform to the SRFI.

Completely rewrote the test file as a Chicken test egg application.

--
John Cowan          http://www.ccil.org/~cowan        xxxxxx@ccil.org
The experiences of the past show that there has always been a discrepancy
between plans and performance.        --Emperor Hirohito, August 1945