On May 2, 10:49=A0am, Slobodan Blazeski <slobodan.blaze...@[EMAIL PROTECTED]
>
wrote:
> I don't know where such thing would be useful. Or is there any real
> life analogy about it.
Practically, maybe something like this could turn up in real code:
(defun raise (init-fn val)
(lambda (helper-fn & rest rest)
(apply init-fn (funcall helper-fn val) rest)))
It raises the order of the function, where order is defined as, "the
number of functions it takes as an input."
Alternatively, I was playing with functional iterators in scheme
recently and you can define an iterator-fn as something that returns
its value, and the next iterator-fn in the sequence or nil if it's at
the end of the sequence.
In this case, pu****ng additional iterators on the front of an existing
iterator raises its order, where order is, like Kaz's definition, the
number of times you have to call a return value before it stops
returning a function.
|
