Church-Rosser equivalent for concatenative languages?
SK combinators are Church-Rosser. 

However, the usual  $\lambda$-calculus method of proving local confluence and then appealing to Newman's lemma doesn't work. You need a slightly fancier argument, and the SEP entry on combinatory logic gives a sketch of a proof that does work.