18 Aug
2011
18 Aug
'11
6:51 p.m.
On 18/08/2011 17:02, Alex Merry wrote:
On 18/08/11 16:08, Ramana Kumar wrote:
what about evaluating f?
So the order of evaluation of (f x y) is f x (f x) y ((f x) y)
This seems like a natural evaluation order for an eager functional language.
I have always understood that the Definition of Standard ML (rule 100) requires this order. The syntax of an application is exp ::= atexp exp atexp ... and the semantics first evaluates the exp to b, then the atexp to v and then applies b to v.
David