Scheme Request for Implementation 207,
"String-notated bytevectors,"
Daphne Preston-Kendal (external notation), John Cowan (procedure
design), and Wolfgang Corcoran-Mathe (implementation),
has gone into FINAL status.

The document and an archive of the discussion are available at <https://srfi.schemers.org/srfi-207/>.

Here's the abstract:

To ease the human reading and writing of Scheme code involving binary
data that for mnemonic reasons corresponds as a whole or in part to
ASCII-coded text, a notation for bytevectors is defined which allows
printable ASCII characters to be used literally without being
converted to their corresponding integer forms. In addition, this SRFI
provides a set of procedures known as the bytestring library for
constructing a bytevector from a sequence of integers, characters,
strings, and/or bytevectors, and for manipulating bytevectors as if
they were strings as far as possible.

Here is the commit summary since the most recent draft:

- correct inconsistency between notation description and formal syntax
- Add missing opening parentheses.
- Make verbs consistent.
- Fix erroneous defaults in bytestring-replace.
- Initial examples.
- Fix argument name typos.
- Copyedit: Missing paragraph tags.
- Additional examples.
- Copyedit.
- Error example for `bytestring'.
- Compactify examples.
- Fix grammar regression.
- Add missing `and'.
- Link to SRFI 4.
- Fix error reported by W3C HTML Validator.
- Finalize.

Here are the diffs since the most recent draft:

<https://github.com/scheme-requests-for-implementation/srfi-207/compare/draft-7..final>

Many thanks to Daphne, John, and Wolfgang, and to everyone who
contributed to the discussion of this SRFI.

Regards,


SRFI Editor

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)