This function is like foldl but works on sublists. That is, its recursion scheme is as follows: if lst is #(e1, e2, ..., en), then this function returns
cons(#(en), cons(..., cons(#(e2,...en), cons(#(e1,...,en), nil) ...)))
| cons | An instance of <function>. The signature of the function is (<list>, <list>) => (<pair>). |
| nil | An instance of <object>. Value returned if the list is empty. In most cases this should be #(). |
| lst | An instance of <list>. |
| result | An instance of <list>. |