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 lambda-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed terms. (C) 2009 Elsevier B.V. All rights reserved.
confluence combinatory logic