I can extend the list: one applicative, one concatenative. One eager, one lazy. One explicitly typed, one inferred.
2 languages won't be enough.
2 languages won't be enough.
Because it really matters whether your function names go before their arguments or after.
1 2 +
You actually write the composition of three functions, which take a stack as input, and return a stack as output. (Well, because the computation is single threaded, you can also say that `1`, `2`, and `+` are procedure that modify a global shared stack).This has little to do with reversed Haskell code.