Panicz Maciej Godek scripsit:

> There are at least two popular and very powerful pattern matchers
> available for Scheme -- one by Alex Shinn, and another by Kent Dybvig.

The R7RS-large language will have a pattern matching library.

> The eager list comprehensions were standardized in the SRFI-42

The trouble with SRFI-42 is that the loops are implemented using
assignment, which is typically less efficient in Scheme than rebinding.
As a result, I expect that some variant of foof-loop, either Alex Shinn's
or Taylor Campbell's, will become part of R7RS-large.  The main difference
between the two of them is the API for adding new loop constructs.

--
John Cowan <cowan@ccil.org>             http://www.ccil.org/~cowan
The internet is a web of tiny tyrannies giving an illusion of anarchy.
                --David Rush

_______________________________________________
Scheme-reports mailing list
Scheme-reports@scheme-reports.org
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports