Could an Applicative Language use Postfix Notation?

I've always found postfix languages like Fa开发者_JAVA百科ctor to be far more readable than prefix (Lispy languages) and infix/postfix languages (all C-style languages, if we include both operators and functions).

Unlike prefix languages, you don't need for delimiters everywhere. Unlike infix notation, there's no complex precedence order to remember. What isn't there to like?

These languages all seem to be concatanative, and thus nearly always stack-based.

Could a modern language be implemented that was applicative over concatanative, and was still postfix-based?