A.: Lazy evaluation and delimited control

A.: Lazy evaluation and delimited control (2009)

Cached

Download Links

[www.osl.iu.edu]

by Ronald Garcia , Andrew Lumsdaine , Amr Sabry

Venue:	In: POPL ’09: Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Citations:	5 - 0 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	A.: Lazy evaluation and delimited control	INFERENCE
AUTHOR NAME	Ronald Garcia	SVM HeaderParse 0.2
AUTHOR AFFIL	Rice University	SVM HeaderParse 0.2
AUTHOR NAME	Andrew Lumsdaine	SVM HeaderParse 0.2
AUTHOR AFFIL	Indiana University	SVM HeaderParse 0.2
AUTHOR NAME	Amr Sabry	SVM HeaderParse 0.2
AUTHOR AFFIL	Categories and Subject Descriptors D.3.1 [Software]: Programming	SVM HeaderParse 0.2
ABSTRACT	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.	SVM HeaderParse 0.2
YEAR	2009	INFERENCE
VENUE	In: POPL ’09: Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	153	INFERENCE
CITATIONS	28 found	ParsCit 1.0