Termination of lambda-calculus with the extra Call-By-Value rule known as assoc
Logic in Computer Science
2008-09-02 v2
Abstract
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.
Cite
@article{arxiv.0806.4859,
title = {Termination of lambda-calculus with the extra Call-By-Value rule known as assoc},
author = {Stéphane Lengrand},
journal= {arXiv preprint arXiv:0806.4859},
year = {2008}
}