I once made a variant of Backus's Turing-lecture language FP, where to compose functions you wrote 'f g' instead of the original 'g o f'. I'm curious if people

I once made a variant of Backus's Turing-lecture language FP, where to compose functions you wrote 'f g' instead of the original 'g o f'. I'm curious if people into concatenative languages would call this one of them -- it satisfies the definition in the article, but there's no stack, so I'd guess not. It's more like point-free Haskell with some notational support for the style. (On second thought, this post's title echoes Backus's. Maybe they would include FP.)