In a language with currying semantics [(((a(b))(c))(d)] the only logical explicit syntax sugar would be LISP-like, so (v n n), (v (v2 n)). That’s imo way worse — you end up with lots of useless junk)))))))) in anything non-trivial.
The rule isn't complicated - functions are left-associative. That's all you have to remember.
What’s gained is that the syntax mirrors the semantics. If you have a function “f : int -> bool -> int”, then “f 5” has type “bool -> int” and “f 5 true” has type “int”. It’s not like in Forth where you can’t tell from the syntax how many arguments a function takes.
That said, I do think right-associative function application may be more intuitive—I like having it in Perl, for example.
(And if you are using composition instead, it associates in both directions.)
At this point it's worth reminding that ML syntax was originally designed to make programs more palatable to maths students...
When so much of your code is function calls, all those commas and parenthesis start cluttering things.
Don't let my complains about syntax deter you, this looks like a very exciting project!
The paren-less function invocation has been around and tried for ages in the ML-family.
(The main downside is that variadic functions are hard to express this way. For fixed arity this is a clear win, also makes partial application nicer to read.)