I suppose I’m needlessly tying laziness with currying, but IME that’s how it tends to work: Haskell holds both laziness and currying sacred, and Lisp has neither without clever macros to explicitly construct the chain of functions.
[/quote]
Strictness and laziness in FPL’s corresponds to call-by-value and call-by-name in reduction strategies for the lambda calculus, that’s all. It would simply be a small change in the reduction strategy to make SML lazy. Currying and laziness are two unrelated concepts.
Actually, I was. While we’re talking about analytical ability, that wasn’t my last post to this thread. I’m terribly sorry that I didn’t respond on your timetable, I’ll consider your feelings thoroughly the next time I contemplate doing anything.
I don’t recall this being a debate, either. I said my peace and I read the responses, some of which have perfectly salient points that I might not have considered previously. Isn’t that enough?