Idiomatic Factor does not (explicitly) use the stack.
That is to say, in Factor, a popular concatenative language, you tend to use higher order functions and high level combinators instead of manually shuffling stuff around on the stack. Sure, from time to time you still need to move stuff into the right place, but its easy to keep track of the stack if you only need to consider two or three items. At least, that seems to be the theory - I have not used Factor in a number of years so don't know how well that holds up in practice.Also, Factor does allow you to use local (named) variables and infix syntax when it makes more sense to do so. Concatenative languages do not need to be unreadable at all and for some things I think the concatenative code is actually more naturally readable.
"If c consumes two arguments, in applicative terms it would be d(c(b, a)); if b consumes one argument and c only one, then it would be d(c(b(a))); if d consumes two arguments, b one, and c none, then it would be d(c, b(a))."
'a b c d' in a concatenative language is akin to 'a | b | c | d' in a shell script (where a stack is being threaded from function to function) or 'd(c(b(a(STACK))))' in most languages where each function has a type 'Stack func (Stack s)'. It doesn't change depending on how many arguments a function takes off the stack - its always 'd(c(b(a(STACK))))'. Of course, since literals are essentially functions which push their value onto the stack, what you say is true if a, b and c are literals. I don't find this nearly as confusing as what it sounds like from your comment.
In code like '1 2 + print', all the words you see are functions. 1 pushes the value of 1 onto the stack and so on. This is interesting because you can easily factor out any part by replacing it with a new word that calls the replaced word:
:A 1 2 + print
:add2 2 + ;
:B a add2 print
A and B are the exact same.This is also interesting: http://concatenative.org/wiki/view/Concatenative%20language
In a shell pipeline of 'a | b | c | d', I can see the dataflow clearly. 'c' never sees the output of 'a' directly; it must be mediated by 'b'. But for a stack, 'a b c d', I have no idea if c uses the value a or not, unless I know the definition of b and how many items c consumes.
When reading stack code, I find myself mentally inserting parentheses to see how far back each operation reaches; for higher-level operators, I find myself wanting to insert comments describing the shape of the code being implicitly constructed. I need to see the "tree" (though frequently a dag) shape.
This isn't different in complex infix expressions. There too, parentheses are often needed for clarity - and good programmers use them even when not necessary - and for very complicated expressions, I'll spread them out across multiple lines, with indentation to make the tree explicit, where performance or similar concerns prevents writing out the expression in a more long-hand fashion.
I've also been doing a lot of Max/MSP programming lately and really love working in its "passing messages along patch cables" system, but am frustrated by its lack of higher order objects and lack of aggregate data types (hell, it won't even let me create a list of lists).
What I really want is a Max/Pd-like language with richer set of data types (algebraic types with pattern matching would be a good start) which can be trivially and unambiguously converted between visual and textual representations. A concatenative language may make this a lot easier.
It's an applicative language created especially for audio DSP. It seems to bridge the gap you describe by providing dataflow combinators and a graphical representation for programs.
For what it's worth, my experience is that practice and good factoring can make concatenative languages much less cryptic. In Forth, the ideal size of a procedure is about a line, and procedures that take more than three arguments are considered a "code smell" that suggests a different factoring might be more appropriate. When you only care about the top few stack elements within any given definition there's a lot less to juggle mentally.
[1] http://en.cppreference.com/w/cpp/language/operator_precedenc...
Yes, but all of those operators are binary operators, instead of let-me-look-at-the-documentation-ary, lots of those precedence rules are drilled into people at a young age, and lots of developers compulsively wrap them in parentheses anyway, just to make their intent absolutely clear.
All of that is very different from the experience of a concatenative language.
That might be the ideal, but if you take a look at real-world Forth code, most of it is much longer than the ideal.
There are a couple of other things that help readability in Forth. One is thorough commenting, and the other is the use of intermediate variables.
Unfortunately, real-world Forth code often doesn't have much of either -- intermediate variables are often frowned upon as being "un-Forthish", and thorough commenting results in a program that is so verbose that (except for the embedded domain) you might as well have written your code in a more conventional language in the first place.
However, giving Prog a concatenative basis lets me do all kinds of interesting things much more easily than if I were to work from lambda calculus. With the syntactic issues taken care of by sugar, it’s a net gain. I hope you’ll see your way to trying it out one day.
[1]http://en.wikipedia.org/wiki/Stack-oriented_programming_lang...
Yes, I know Christopher Diggins' Cat is statically typed. The problem isn't in compiler diagnostics, it's in readability.
In a stack language, an expression as simple as 'a b c d' is cryptic. If c consumes two arguments, in applicative terms it would be d(c(b, a)); if b consumes one argument and c only one, then it would be d(c(b(a))); if d consumes two arguments, b one, and c none, then it would be d(c, b(a)). And this ambiguity makes it very hard for me to read the code unless I'm intimate with all the individual words. You have to understand everything to understand anything.
Unfortunately, I suspect that concatenative languages tend to derive their power from this ambiguity, because the lack of specificity leaves considerable flexibility for what the words can do with the stack.
So my considered opinion for now - and this article doesn't really change that, it is mostly a tutorial - is that stack languages are best as a compiler target rather than a human source form.