Loading...
Please wait, while we are loading the content...
Refining reduction in the lambda calculus
| Content Provider | Scilit |
|---|---|
| Author | Kamareddine, Fairouz Nederpelt, Rob |
| Copyright Year | 1995 |
| Description | 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’. |
| Related Links | https://pure.tue.nl/ws/files/2330983/9411070.pdf https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E35C06DB3BCAD433E4BADE2743678C63/S0956796800001507a.pdf/div-class-title-refining-reduction-in-the-lambda-calculus-a-href-fn01-ref-type-fn-a-div.pdf |
| Ending Page | 651 |
| Page Count | 15 |
| Starting Page | 637 |
| ISSN | 09567968 |
| e-ISSN | 14697653 |
| DOI | 10.1017/s0956796800001507 |
| Journal | Journal of Functional Programming |
| Issue Number | 4 |
| Volume Number | 5 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 1995-10-01 |
| Access Restriction | Open |
| Subject Keyword | Journal of Functional Programming Lambda Calculus |
| Content Type | Text |
| Resource Type | Article |
| Subject | Software |