A direct proof of the confluence of combinatory strong reduction

René David (1)

1 LAMA - Laboratoire de Mathématiques

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.

Mots clés: Combinatory Logic; confluence

Domaines: Logique [math.LO]; Logique en informatique [cs.LO]

René David. A direct proof of the confluence of combinatory strong reduction. Theoretical Computer Science, 2009, 410 (42), pp.4204-4215. ⟨hal-00384573⟩