Is the application definition function determinate in SML?

Question

In OCaml, the evaluation order of a function application is not specified (it is non-deterministic).

In standard ML, is it also non-deterministic or deterministic? Can you provide a link to a specification section that clarifies?

---

Edit: for those of you who came later, I also found out that, like SML, in F # the order is set and determined - unlike OCaml, which is even crazier considering how close they are to the syntax. It's easy to forget if you switch between them a lot.

Answer 1

, ( 6.7 ) SML . , (, 102). , (, , ) ( 92/95).

, , , f(a,b)(c,d) f, a, b, f(...), c, d, g(...), g f(...).