A direct proof of the confluence of combinatory strong reduction

A direct proof of the confluence of combinatory strong reduction

I give a proof of the confluence of combinatory strong reduction that does not use the one of λ -calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed terms.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science 2009-09, Vol.410 (42), p.4204-4215
1. Verfasser: David, René
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Combinatory logic
Computer Science
Computer science
control theory
systems
Confluence
Exact sciences and technology
General logic
Logic
Logic and foundations
Logic in Computer Science
Mathematical logic, foundations, set theory
Mathematics
Miscellaneous
Sciences and techniques of general use
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:I give a proof of the confluence of combinatory strong reduction that does not use the one of λ -calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed terms.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2009.04.017