2000 character limit reached
A direct proof of the confluence of combinatory strong reduction (0905.2545v1)
Published 15 May 2009 in math.LO and cs.LO
Abstract: 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.