Abstract
Purchase PDF (266 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (14)
Purchase PDF (1740 K)
and an intersection type assignment system 
. First we define a translation tr from intersection types to second-order types. Then we define a system 
doi:10.1016/S0304-3975(98)00359-4 
Copyright © 1999 Published by Elsevier Science B.V. All rights reserved.
Syntactic control of interference revisited
References and further reading may be available for this article. To view references and further reading you must purchase this article.
P. W. O’Hearn1, 
, 
, , a, A. J. Power2, , b, M. Takeyama3, , b and R. D. Tennent4, , c
Available online 15 October 1999.
Abstract
In “syntactic control of interference” (POPL, 1978), J.C. Reynolds proposes three design principles intended to constrain the scope of imperative state effects 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
) and simple imperative languages (such as the language of while programs). However, Reynolds points out that the “obvious” syntax for interference control has the unfortunate property that β-reductions do not always preserve typings. Reynolds has subsequently presented a solution to this problem (ICALP, 1989), but it is fairly complicated and requires intersection types in the type system. Here, we present a much simpler solution which does not require intersection types. We first describe a new type system inspired in part by linear logic and verify that reductions preserve typings. We then define a class of “bireflective” models, which provide a categorical analysis of structure underlying the new typing rules; a companion paper “Bireflectivity”, in this volume, exposes wider ramifications of this structure. Finally, we describe a concrete model for an illustrative programming language based on the new type system; this improves on earlier such efforts in that states are not assumed to be structured using locations.
Author Keywords: Denotational semantics; Type systems; Interference; Aliasing
1 Current address: Department of Computer Science, Queen Mary and Westfield College, London, E1 4NS, UK. This author was supported by NSF grant CCR-92110829.
2 This author gratefully acknowledges the support of ESPRIT Basic Research Action 6453: Types for proofs and programs.
3 Current address: Department of Computing Science, Chalmers University of Technology, Eklandagatan 86, 412 96 Gteborg, Sweden. This author was supported by an Edinburgh University Postgraduate Studentship.
4 This author was supported by an operating grant from the Natural Sciences and Engineering Research Council of Canada.
Corresponding author; email: ohearn@dcs.qmw.ac.uk
