A direct proof of the confluence of combinatory strong reduction

Simple item page
dc.creatorDavid, René
dc.date2009-05-15
dc.date.accessioned2026-07-07T13:15:51Z
dc.date.available2026-07-07T13:15:51Z
dc.descriptionI 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.
dc.descriptionTo appear in TCS
dc.identifierhttps://arxiv.org/abs/0905.2545
dc.identifierhttp://arxiv.org/abs/0905.2545
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230603
dc.subjectLogic
dc.subjectLogic in Computer Science
dc.titleA direct proof of the confluence of combinatory strong reduction
dc.typetext

Files

Collections

arXiv