[1] https://en.wikipedia.org/wiki/Concatenative_programming_lang...
This all works well for untyped languages (FORTH is untyped, as an example), but once you add in reasonably complex types you can't really use "sequences" alone, anymore; the directly comparable property is instead true of string diagrams. And once you add some more complexity, you even have to deal with, e.g. proof nets. There are ways to simplify textual syntaxes like e.g. typed lambda calculus along 'concatenative' lines, but mostly these are simple tweaks (De Bruijn notation, and/or De Bruijn indexes) that don't really create a "different" language.
Interestingly, PostScript is also concatenative.
If you've ever used an RPN calculator, you almost understand how concatenative languages work!