Michael Sperber [Mr. Preprocessor]
Tue, 19 Mar 2002 11:07:35 +0100
>>>>> "Cagdas" == Cagdas Ozgenc <firstname.lastname@example.org> writes:
Cagdas> Koen Claessen contributed:
>> Somehow I do not think that Cagdas was talking about
>> evaluation order at all. I think he referred to the
>> following: Suppose I have a function f which is defined to
>> have 3 arguments:
Cagdas> That's right. I was thinking of the following syntax. I orginally had the
Cagdas> idea for C++, where you can't do partial application at all.
Cagdas> f x y z=...
Cagdas> f # 3 4
As another note on the subject, this is similar to SRFI 26 for Scheme
which can be found at:
Cheers =8-} Mike
Friede, Völkerverständigung und überhaupt blabla