| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435429 | Theoretical Computer Science | 2009 | 12 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
