As discussed briefly on IRC, I that think a subrange procedure would
be useful:

(subrange range start end)

Returns a range with the same element comparator as *range* which
contains the elements of *range* from index *start*, inclusive,
through index *end*, exclusive.  This procedure must run in O(1)
time.


I think it might also be wise to state in the SRFI document that the
following existing procedures also preserve the element comparator
of their range arguments:

* range-take(-right)
* range-drop(-right)
* range-reverse
* range-take-while(-right)
* range-drop-while(-right)

It seems obvious, but all hell would break loose if ranges and their
subranges were to have different element comparators.

Otherwise, everything looks good to me.

--
Wolfgang Corcoran-Mathe  <xxxxxx@sigwinch.xyz>

"The composer makes plans, music laughs." --Morton Feldman