A monadic framework for delimited continuations

A monadic framework for delimited continuations (2005)

by R. Kent Dybvig , Simon Peyton Jones , Amr Sabry

Venue:	IN PROC
Citations:	10 - 2 self

User correction supplied by mph

Datum	Value	Source
TITLE	A monadic framework for delimited continuations	INFERENCE
AUTHOR NAME	R. Kent Dybvig	user correction
AUTHOR AFFIL	Computer Science Department; Indiana University; Bloomington, Indiana	user correction
AUTHOR ADDR	47405-7104; c ○ 2005 R. Kent Dybvig, Simon Peyton Jones, Amr Sabry	user correction
AUTHOR NAME	Simon Peyton Jones	user correction
AUTHOR AFFIL	Microsoft Research	user correction
AUTHOR NAME	Amr Sabry	user correction
AUTHOR AFFIL	Indiana University	user correction
AUTHOR ADDR		user correction
ABSTRACT	Delimited continuations are more expressive than traditional abortive continuations and they apparently seem to require a framework beyond traditional continuation-passing style (CPS). We show that this is not the case: standard CPS is sufficient to explain the common control operators for delimited continuations. We demonstrate this fact and present an implementation as a Scheme library. We then investigate a typed account of delimited continuations that makes explicit where control effects can occur. This results in a monadic framework for typed and encapsulated delimited continuations which we design and implement as a Haskell library.	user correction
YEAR	2005	SVM HeaderParse 0.2
VENUE	IN PROC	user correction
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Tech. Rep. 615	INFERENCE
CITATIONS	28 found	ParsCit 1.0