>The eleven functions not included are the R4RS string-comparison functions:
>    string=?  string-ci=?
>    string<?  string-ci<?
>    string>?  string-ci>?
>    string<=? string-ci<=?
>    string>=? string-ci>=?
>    substring

SUBSTRING is not a string-comparison function.

>string-every pred s [start end] -> boolean
>string-any   pred s [start end] -> value

Why not allow using CHAR/CHAR-SET/PRED here?

>string-contains    s1 s2 [start1 end1 start2 end2] -> integer or false
>string-contains-ci s1 s2 [start1 end1 start2 end2] -> integer or false
>    Does string S1 contain string S2?

>    Return the index in S1 where S2 occurs as a substring, or false.
>    The optional start/end indices restrict the operation to the
>    indicated substrings.

>    The returned index is in the range [start1,end1). A successful match
>    must lie entirely in the [start1,end1) range of S1.

>    The reference implementation uses the Knuth-Morris-Pratt algorithm.

This comment does not belong in the final SRFI document.

--
/****************************************************************\
* You have just read a message from Mikael Ståldal.              *
*                                                                *
* Remove "-ingen-reklam" from the address before mail replying.  *
\****************************************************************/