This helps when performing fusion of list operations. It also helps
when executing fold concurrently (i.e. MapReduce). My (toy) compiler
did both. In general, it's a good idea to give a compiler maximum
freedom of implementation. Just because no existing compiler does it,
doesn't mean a future one won't.
On 9/28/06, Marcin 'Qrczak' Kowalczyk <qrczak_at_knm.org.pl> wrote:
> "Pinku Surana" <suranap_at_gmail.com> writes:
>
> > It'd be nice to have a simple "fold" procedure which does not impose
> > an iteration order when one is not required (like hash-table-fold).
> > Most implementators will likely (define fold fold-left).
>
> Is there any implementation which would not?
>
> --
> __("< Marcin Kowalczyk
> \__/ qrczak_at_knm.org.pl
> ^^ http://qrnik.knm.org.pl/~qrczak/
>
> _______________________________________________
> r6rs-discuss mailing list
> r6rs-discuss_at_lists.r6rs.org
> http://lists.r6rs.org/cgi-bin/mailman/listinfo/r6rs-discuss
>
Received on Fri Sep 29 2006 - 16:05:37 UTC