Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952222 | Theoretical Computer Science | 2017 | 46 Pages |
Abstract
This second part of [13] takes up the showing in detail of the properties in [13, §3] for the proposed definitions of abstraction and combinatory β-reduction. The difficult cases are (R3) (the Church-Rosser Theorem) and (R6) on irreducible CL-terms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jonathan P. Seldin,