Syntactic control of interference revisited

  title={Syntactic control of interference revisited},
  author={Peter W. O'Hearn and John Power and Robert D. Tennent and Makoto Takeyama},

Type reconstruction for syntactic control of interference. 2

  • Hongseok YangHoward Huang
  • Computer Science
    Proceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225)
  • 1998
This paper improves upon H. Huang and U.S. Reddy's type inference system for SCI based languages in two significant ways, eliminating the need for explicit coercion operators in terms and considering adding let-bound polymorphism, which appears to be nontrivial in the presence of interference control.

A Fully Abstract Relational Model of Syntactic Control of Interference

Using familiar constructions on the category of monoids, a fully abstract model of Basic SCI is constructed, showing that Reddy's model is fully abstract, which was not previously known.

Using Haskell to Implement Syntactic Control of Interference

Inference rules and denotational semantics functions are presented for pcf, Idealized algol, sci, and scir and an extension to haskell98 is used to define haskell functions for those languages’ semantics and to define type constructions to statically check their syntax.

Imperative Lambda Calculus Revisited

A revised type system for Imperative Lambda Calculus is proposed that is too restrictive and lacks the subject reduction property, and extended to handle Hindley-Milner style polymorphism and devise type reconstruction algorithms.

Beyond ML

We believe that the most pressing problem in programming-language design is to control the interference that arises when functional and imperative programming are combined, and to give the user more

Categorical Models of Syntactic Control of Intereference Revisited, Revisited

The previously proposed notion of bireflective model is rejected as being too restrictive to accommodate important concrete models based on game semantics and object spaces and a new, more general notion of model is proposed and the coherence property proved.

Syntactic Control of Interference for Separation Logic ( Preliminary Report )

A system of rules based on the principles of syntactic control of interference is provided, which provides a clear formalization of the Owicki-Gries rules whose soundness is obvious and also respects the traditional conventions of variable usage so that pitfalls in reasoning can be avoided.

Objects, interference and the Yoneda embedding

From Algol to polymorphic linear lambda-calculus

This work translates two variations on Algol 60 into a purely functional language with polymorphic linear types, and demonstrates that a linearly-typed functional language can be at least as expressive as AlGol.

Type Reconstruction for SCI , Part 2 Hongseok

This paper makes SCI-based languages more practical by introducing a revised version of Huang and Reddy's type reconstruction system HR96] with two signiicant improvements, including the need for explicit coercion operators in terms.



Syntactic Control of Inference, Part 2

In 1978, we proposed that Algol-like languages should be constrained so that aliasing between variables and, more generally, interference between commands or procedures would be syntactically

Syntactic control of interference

This work shows how to eliminate difficulties by imposing syntactic restrictions, without prohibiting the kind of constructive interference which occurs with higher-order procedures or SIMULA classes, among components of collections named by single identifiers.

Semantical Analysis of Specification Logic

Semantical Analysis of Specification Logic, 2

This interpretation provides the first model for all of Reynold′s axioms (except the equivalences formerly used to define procedural non-interference) and formalizes a method used by Reynolds to reason about programs with multiple levels of abstraction.

A model for syntactic control of interference

  • P. O'Hearn
  • Computer Science
    Mathematical Structures in Computer Science
  • 1993
Reynolds' concept of passive type - i.e. types for phrases that do not write to any storage variables - is shown to be closely related, in this model, to Girard's ‘of course’ modality.

Semantics of Interference Control

Global state considered unnecessary: An introduction to object-based semantics

  • U. Reddy
  • Computer Science
    LISP Symb. Comput.
  • 1996
A novel approach based on a notion of objects to characterize them in terms of their observable behavior and it is shown that this leads to considerable accuracy in the semantic modelling of locality and single-threadedness properties of objects.

Hints on programming language design.

The view that a programming language is a tool which should assist the programmer in the most difficult aspects of his art, namely program design, documentation, and debugging is presented.

Passivity and independence

  • U. Reddy
  • Computer Science
    Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science
  • 1994
A semantic model is defined which captures the notions of "change", "absence of change" and "independent change" etc by extending the author's "linear logic model of state" with dependence/independence relations so that sequential traces give way to pomset traces.

Conception, evolution, and application of functional programming languages

The foundations of functional programming languages are examined from both historical and technical perspectives, and current research areas—such as parallelism, nondeterminism, input/output, and state-oriented computations—are examined with the goal of predicting the future development and application of functional languages.