Evaluating Call-By-Need on the Control Stack

Details Evaluating Call-By-Need on the Control Stack Evaluating Call-By-Need on the Control Stack

2010-09-16

arxiv.org/abs/1009.3174v1

Computer Science

Programming Languages

Symposium on Trends in Functional Programming (TFP 2010), Norman, Oklahoma, May 2010

Scientific paper

Ariola and Felleisen's call-by-need {\lambda}-calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substitution, function applications-once established-are never discharged. In this paper we show how to translate this notion of reduction into an abstract machine that resolves variable references via the control stack. In particular, the machine uses the static address of a variable occurrence to extract its current value from the dynamic control stack.

Affiliated with

Also associated with

No associations

Rating

Evaluating Call-By-Need on the Control Stack 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 Evaluating Call-By-Need on the Control Stack, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evaluating Call-By-Need on the Control Stack will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27655