Lazy Evaluation and Delimited Control

Details Lazy Evaluation and Delimited Control Lazy Evaluation and Delimited Control

2010-03-26

arxiv.org/abs/1003.5197v3

LMCS 6 (3:1) 2010

Computer Science

Programming Languages

Scientific paper

10.2168/LMCS-6(3:1)2010

The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a series of reasoning steps, we systematically unpack the standard-order reduction relation of the calculus and discover a novel abstract machine definition which, like the calculus, goes "under lambdas." We prove that machine evaluation is equivalent to standard-order evaluation. Unlike traditional abstract machines, delimited control plays a significant role in the machine's behavior. In particular, the machine replaces the manipulation of a heap using store-based effects with disciplined management of the evaluation stack using control-based effects. In short, state is replaced with control. To further articulate this observation, we present a simulation of call-by-need in a call-by-value language using delimited control operations.

Affiliated with

Also associated with

No associations

Rating

Lazy Evaluation and Delimited Control 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 Lazy Evaluation and Delimited Control, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lazy Evaluation and Delimited Control will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183067