Bad Variables Under Control

Murawski, Andrzej S.

doi:10.1007/978-3-540-74915-8_41

Cited by 5 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have seen in Section 3.4.4 that for IA, strategies are indistinguishable iff they have the same complete plays. In the presence of control this phenomenon gets stronger: strategies are indistinguishable iff they have the same plays [Mur07]. Hence, M is an innocent well-bracketed strategy (even though M might internally use state and control).…”

Section: Figure 28: the Semantic Cubementioning

confidence: 99%

“…The Semantic Cube. We temporarily consider, for the sake of the discussion, a setting with both control and state; say Murawski's model for interference and control [Mur07], which is essentially equivalent (modulo the representation with pointers) to ours where basic arenas have no conflict and answers are replicated. Let us call it by Vis.…”

mentioning

confidence: 99%

“…We have reviewed two cases before, namely PCF (Theorem 3.10) and PCF `interference (Theorem 3.14). The full abstraction result for PCF `control is due to Laird [Lai97], while for PCF `interference `control appears in Murawski 13 [Mur07].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Disentangling Parallelism and Interference in Game Semantics

Castellan,

Clairambault

2021

Preprint

View full text Add to dashboard Cite

Game semantics is a denotational semantics presenting compositionally the computational behaviour of various kinds of effectful programs. One of its celebrated achievement is to have obtained full abstraction results for programming languages with a variety of computational effects, in a single framework. This is known as the semantic cube or Abramsky's cube, which for sequential deterministic programs establishes a correspondence between certain conditions on strategies ("innocence", "well-bracketing", "visibility") and the absence of matching computational effects.Outside of the sequential deterministic realm, there are still a wealth of game semanticsbased full abstraction results; but they no longer fit in a unified canvas. In particular, Ghica and Murawski's fully abstract model for shared state concurrency (IA ) does not have a matching notion of pure parallel program -we say that parallelism and interference (i.e. state plus semaphores) are entangled. In this paper we construct a causal version of Ghica and Murawski's model, also fully abstract for IA . We provide compositional conditions parallel innocence and sequentiality, respectively banning interference and parallelism, and leading to four full abstraction results. To our knowledge, this is the first extension of Abramsky's semantic cube programme beyond the sequential deterministic world.

show abstract

Section: Figure 28: the Semantic Cubementioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Disentangling Parallelism and Interference in Game Semantics

Castellan,

Clairambault

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…It turned out that, in the call-by-name framework, it could be circumvented by employing suitably crafted (pre)orders on plays [14,18], but no result of this kind has been reported for call-by-value. However, an alternative and general approach to dealing with bad variables seems to have emerged in the form of nominal game semantics [10,2,23].…”

Section: Introductionmentioning

confidence: 99%

Full abstraction for Reduced ML

Murawski

Tzevelekos

2013

Annals of Pure and Applied Logic

Self Cite

View full text Add to dashboard Cite

Abstract. We present the first effectively presentable fully abstract model for Stark's Reduced ML, the paradigmatic higher-order programming language combining call-by-value evaluation and integer-valued references. The model is constructed using techniques of nominal game semantics. Its distinctive feature is the presence of carefully restricted information about the store in plays, combined with conditions concerning the participants' ability to distinguish reference names. This leads to an explicit characterization of program equivalence.

show abstract