On 27 Sep 2025, at 17:01, Arthur A. Gleckler <xxxxxx@speechcode.com> wrote:

> I've just published draft #2 of SRFI 262. It was submitted by Daphne Preston-Kendal, author of the SRFI.

Thank you, Arthur.

With the release of draft 2 of the SRFI comes also the release of version 0.75 of the sample implementation, extensible-match.

Apart from following the latest changes in the specification, this version also makes the following changes and additions compared to v0.5:

• fixed a bug that meant some pattern variables were not bound when they should have been, and some valid patterns refused to compile at all
• support for Guile (with the caveat that expansion of match forms is very slow due to a somewhat brute force approach to implementing pattern syntax lookup with module reflection)
• factored the identifier property dependent parts into their own sublibrary, so that other implementations could also potentially get an implementation-specific approach to pattern syntax definition and transformer lookup by providing and implementation-specific version of that sublibrary, like the one for Guile
• actually provides the (srfi :262) and (srfi :262 match) libraries
• various minor improvements to the efficiency of expanded match forms

See <https://codeberg.org/dpk/extensible-match/compare/v0.5..v0.75> for a commit log between the two versions.
Get it from <https://codeberg.org/dpk/extensible-match/archive/v0.75.tar.gz>.

Best wishes

Daphne