2000 character limit reached
A direct proof of the confluence of combinatory strong reduction
Published 15 May 2009 in math.LO and cs.LO | (0905.2545v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
