A Fully Abstract Semantics and a Proof System for an ALGOL-Like Language with Sharing
نویسنده
چکیده
Stephen D. Brookes Computer Science Department Carnegie-Mellon University Pi t tsburgh Pennsylvania 15213
منابع مشابه
Algol-like Language (preliminary Report)
We present a denotational semantics for an Algol-like language Alg which is fully abstract for the second order subset of Alg. This constitutes the rst signiicant full abstraction result for a block structured language with local variables. In this preliminary report we concentrate on the construction of the denotational model and on the main ideas of the full abstraction proof. For more backgr...
متن کاملAlgol-like Language
We present a denotational semantics for an Algol-like language Alg, which is fully abstract for the second order subset of Alg. This constitutes the rst signiicant full abstraction result for a block structured language with local variables. As all the published`test equivalences' 13, 8, 23] for Algol-like languages are contained in the second order subset, they can all be validated (easily) in...
متن کاملFull Abstraction for the Second Order Subset of an Algol-Like Language
We present a denotational semantics for anAlgol like languageAlg which is fully abstract for the second order subset of Alg This constitutes the rst signi cant full abstraction result for a block structured language with local variables As all the published test equivalences for Algol like languages are contained in the second order subset they can all be validated easily in our denotational mo...
متن کاملLinearity, Sharing and State: a Fully Abstract Game Semantics for Idealized Algol with Active Expressions Extended Abstract Abramsky and Mccusker
The manipulation of objects with state which changes over time is all-pervasive in computing. Perhaps the simplest example of such objects are the program variables of classical imperative languages. An important strand of work within the study of such languages, pioneered by John Reynolds, focusses on \Idealized Algol", an elegant synthesis of imperative and functional features. We present a n...
متن کاملThe regular-language semantics of second-order idealized ALGOL
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our model inherits its good theoretical properties; in fact, for second-order IA taken as a stand-alone langua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985