A direct proof of the confluence of combinatory strong reduction

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
To appear in TCS

Keywords

Logic, Logic in Computer Science

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/230603

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0905.2545
 http://arxiv.org/abs/0905.2545

Collections

arXiv