Observable Sequentiality and Full Abstraction

Observable Sequentiality and Full Abstraction (1992)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Robert Cartwright , Matthias Felleisen

Venue:	In Proceedings of POPL ’92
Citations:	38 - 5 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Observable Sequentiality and Full Abstraction	user correction - Legacy Corrections
AUTHOR NAME	Robert Cartwright	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	ion Robert Cartwright Matthias Felleisen Department of Computer Science Rice University Houston, TX 77251-1892 Abstract One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fifteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting the evaluation order of arguments in procedures. Since we believe that such facilities are crucial for understanding the nature of sequential computation, this paper focuses on a sequential extension of PCF (called SPCF) that includes two classes of control operators: error generators and escape handlers. These new control operators enable us to construct a fully abstract model for SPCF that interprets higher types as sets of error-sensitive functions instead of continuous...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	In Proceedings of POPL ’92	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	328--342	INFERENCE
CITATIONS	7 found	ParsCit 1.0