If one understands adding and consuming values at the top of the stack, putting the stack in the state you want it is certainly a small logical step without new theoretical baggage.
Word definitions and the accompanying pointer tricks are more likely to be challenging.
Not sure they are that interested in programming, but FORTH is a little sweet language.
My first experience with it was Paul Lutus’ GraFORTH. On the Apple II it was ridiculously fast.
n coined the term careware. iirc.
first-hand info. i had downloaded n used arachnophilia.
he is on hn.
Prefix technically doesn’t need, either, if you avoid functions taking variable number of arguments and have a grammar that can reliably detect function calls (could be hard if you’re allowing higher-order functions)
Even with functions taking a variable number of arguments, you could do it the C way and use the argc, argv trick, giving you
* 2 + 3 5 6 7 3 ⇒ (* (+ 5 6 7) 3) ⇒ 54
I think you’d have to be a bit of a masochist to do that, though.That also is why I think varargs functions tend to be rare in bare bones forths. You’d have to write
5 6 7 3 + 3 2 *
Using custom names for the varargs functions would help for the 2-argument version.