Reasoning with Continuations II: Full Abstraction for Models of Control

Reasoning with Continuations II: Full Abstraction for Models of Control (1990)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dorai Sitaram , Matthias Felleisen

Venue:	In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming
Citations:	29 - 4 self

Versions

Version History

Metadata Version 2

Datum	Value	Source
TITLE	Reasoning with Continuations II: Full Abstraction for Models of Control	INFERENCE
AUTHOR NAME	Dorai Sitaram	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; Rice University	SVM HeaderParse 0.2
AUTHOR ADDR	Houston, TX 77251-1892	SVM HeaderParse 0.1
AUTHOR NAME	Matthias Felleisen	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; Rice University	SVM HeaderParse 0.2
AUTHOR ADDR	Houston, TX 77251-1892	SVM HeaderParse 0.1
ABSTRACT	A fully abstract model of a programming language assigns the same meaning to two terms if and only if they have the same operational behavior. Such models are well-known for functional languages but little is known about extended functional languages with sophisticated control structures. We show that a direct model with error values and the conventional continuation model are adequate for functional languages augmented with first- and higher-order control facilities, respectively. Furthermore, both models become fully abstract on adding a control delimiter and a parallel conditional to the programming languages. 1 The Control Structure of Lisp Many programming languages, in particular Lisp [17, 24] and Scheme [22, 26], contain sophisticated control structures with constructs for labeling the control state at an arbitrary point for later reuse. Since Lisp is an expression-oriented language, a jump to a labeled control state---just like a procedure---may also pass a parameter so that it is possible to communicate results between control points. In most Lisp systems, control points have a special status, distinct from all other values. The The work of both authors was partially supported by	SVM HeaderParse 0.1
YEAR	1990	INFERENCE
VENUE	In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	161--175	INFERENCE
CITATIONS	28 found	ParsCit 1.0