This exact same line of thinking went through my head a few days ago. Since I'm starting to toy with learning Japanese I wondered how a programming language with a SOV ordered syntax would look like. I guess now I know.
An interesting property of postfix languages is that the order of evaluation of functions is identical to the order of the function names in the source code:
Functional (prefix, C)
f3(f1("") f2(""))
"".f1().f3("".f2())
"" f1 "" f2 f3