[r6rs-discuss] Multiple returns from higher-order procedures

From: Michael Sperber <sperber>
Date: Sat, 16 Jun 2007 18:07:52 +0200

AndrevanTonder <andre at het.brown.edu> writes:

> The following generate lists
>
> REMP, REMOVE, REMV, REMQ

Ah, forgot. Thanks!

> The following will often return lists
>
> FOLD-LEFT, FOLD-RIGHT
>
> but even in the case where they do not generate lists, the above requirement
> will still make sense (it just refers to "return value of earlier returns").

Could you explain? It seems clear from the description that `fold-left'
doesn't mutate the intermediate values, simply by the absence of
anything saying that it does mutate. (This is different from those that
generate intermediate data structures themselves.)

-- 
Cheers =8-} Mike
Friede, V?lkerverst?ndigung und ?berhaupt blabla
Received on Sat Jun 16 2007 - 12:07:52 UTC

This archive was generated by hypermail 2.3.0 : Wed Oct 23 2024 - 09:15:01 UTC