Syntactic control of interference revisited

Syntactic Control of Interference Revisited

In “syntactic control of interference” (POPL, 1978), J.C. Reynolds proposes three design principles intended to constrain the scope of imperative state e ects in Algol-like languages. The resulting linguistic framework seems to be a very satisfactory way of combining functional and imperative concepts, having the desirable attributes of both purely functional languages (such as PCF) and simple ...

Decidability and syntactic control of interference

We investigate the decidability of observational equivalence and approximation in Reynolds’ “Syntactic Control of Interference” (SCI), a prototypical functionalimperative language in which covert interference between functions and their arguments is prevented by the use of an affine typing discipline. By associating denotations of terms in a fully abstract “relational” model of finitary basic S...

A Model for Syntactic Control of Interference

Decidability in Syntactic Control of Interference

We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By associating denotations of terms in an inequationally fully abstract model of finitary basic SCI with multitape finite state automata, we show that observational approximation is not decidable (even at first order), but that observational equivalence is decidable for a...

Games for syntactic control of interference

This thesis proposes a game semantics for languages that adhere to the design principles first proposed by John Reynolds in Syntactic Control of Interference. A pair of subterms of a program written in a language adherent to the SCI principles enjoy the property that the evaluation of one will have no impact on the subsequent evaluation of the other if they contain no free identifier in common....