Termination of lambda-calculus with the extra Call-By-Value rule known as assoc
| dc.creator | Lengrand, Stéphane | |
| dc.date | 2008-06-30 | |
| dc.date | 2008-09-02 | |
| dc.date.accessioned | 2026-07-07T09:59:35Z | |
| dc.date.available | 2026-07-07T09:59:35Z | |
| dc.description | In this paper we prove that any lambda-term that is strongly normalising for beta-reduction is also strongly normalising for beta,assoc-reduction. assoc is a call-by-value rule that has been used in works by Moggi, Joachimsky, Espirito Santo and others. The result has often been justified with incomplete or incorrect proofs. Here we give one in full details. | |
| dc.identifier | https://arxiv.org/abs/0806.4859 | |
| dc.identifier | http://arxiv.org/abs/0806.4859 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168071 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Termination of lambda-calculus with the extra Call-By-Value rule known as assoc | |
| dc.type | text |