A direct proof of the confluence of combinatory strong reduction

I give a proof of the confluence of combinatory strong reduction that does not use the one of λ-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed terms.