Fully Abstract Semantics for Observably Sequential Languages

Simple item page
dc.contributor.authorCartwright, Roberten_US
dc.contributor.authorCurien, Pierre-Louisen_US
dc.contributor.authorFelleisen, Matthiasen_US
dc.date.accessioned2017-08-02T22:03:22Zen_US
dc.date.available2017-08-02T22:03:22Zen_US
dc.date.issued1994-01en_US
dc.date.noteJanuary 1994en_US
dc.description.abstractOne of the major challenges in denotational semantics is the construction of a fully abstract semantics for a higher-order sequential programming language. For the past fifteen years, research on this problem has focused on developing a semantics forPCF, 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 to procedures. Since we believe that these facilities play a crucial role in sequential computation, this paper focuses on a sequential extension of PCF, called SPCF, that includes two classes of control operators: a possibly empty set of error generators and a collection of catch and throw constructs. For each set of error generators, the paper presents a fully abstract semantics for SPCF. If the set of error generators is empty, the semantics interprets all procedures—including catch and throw—as Berry-Curien sequential algorithms. If the language contains error generators, procedures denote {\it manifestly sequential} functions. The manifestly sequential functions form aScott domain that is isomorphic to a domain of decision trees, which is the natural extension of the Berry-Curien domain of sequential algorithms in the presence of errors.en_US
dc.format.extent93 ppen_US
dc.identifier.citationCartwright, Robert, Curien, Pierre-Louis and Felleisen, Matthias. "Fully Abstract Semantics for Observably Sequential Languages." (1994) https://hdl.handle.net/1911/96437.en_US
dc.identifier.digitalTR93-219en_US
dc.identifier.urihttps://hdl.handle.net/1911/96437en_US
dc.language.isoengen_US
dc.rightsYou are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).en_US
dc.titleFully Abstract Semantics for Observably Sequential Languagesen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR93-219.pdf
Size:
53.3 MB
Format:
Adobe Portable Document Format
Download
Collections
Computer Science Technical Reports