Abstract
We introduce a ¿-calculus notation which enables us to detect in a term, more ß-redexes than in the usual notation. On this basis, we define an extended ß-reduction which is yet a subrelation of conversion. The Church Rosser property holds for this extended reduction. Moreover, we show that we can transform generalised redexes into usual ones by a process called ‘term reshuffling’.
Original language | English |
---|---|
Pages (from-to) | 637-651 |
Number of pages | 24 |
Journal | Journal of Functional Programming |
Volume | 5 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1995 |