Computer Science – Logic in Computer Science
Scientific paper
2008-06-30
Computer Science
Logic in Computer Science
Scientific paper
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.
No associations
LandOfFree
Termination of lambda-calculus with the extra Call-By-Value rule known as assoc does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Termination of lambda-calculus with the extra Call-By-Value rule known as assoc, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Termination of lambda-calculus with the extra Call-By-Value rule known as assoc will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-154858