2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/230603I give a proof of the confluence of combinatory strong reduction that does not use the one of lambda-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed terms.To appear in TCSLogicLogic in Computer Sciencetext