Abstract
Using familiar constructions on the category of monoids, a fully abstract model of Basic SCI is constructed. Basic SCI is a version of Reynolds’s higher-order imperative programming language Idealized Algol, restricted by means of a linear type system so that distinct identifiers are never aliases. The model given here is concretely the same as Reddy’s object spaces model, so this work also shows that Reddy’s model is fully abstract, which was not previously known.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. In Proceedings, Thirteenth Annual IEEE Symposium on Logic in Computer Science, pages 334–344. IEEE Computer Society Press, 1998.
S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In R.D. Tennent, editors. Algol-like Languages. Birkhaüser, 1997. O’Hearn and Tennent [7], pages 297–329 of volume 2.
J. Hogg. Islands: Aliasing protection in object-oriented languages. In Proceedings of the OOPSLA’ 91 Conference on Object-oriented Programming Systems, Languages and Applications, pages 271–285, November 1991.
B. Jacobs. Semantics of weakening and contraction. Annals of Pure and Applied Logic, 69:73–106, 1994.
P. W. O’Hearn. Resource interpretations, bunched implications and the α - λ-calculus. In J.-Y. Girard, editor, Proceedings, Typed Lambda-Calculi and Applications, L’Aquila, Italy, April 1999, volume 1581 of LNCS, pages 258–279. Springer-Verlag, 1999.
P.W. O’Hearn, A. J. Power, M. Takeyama, and R.D. Tennent. Syntactic control of interference revisited. Theoretical Computer Science, 228(1-2):211–252, 1999. A preliminary version appeared in the proceedings of MFPS XI.
P.W. O’Hearn and R.D. Tennent, editors. Algol-like Languages. Birkhaüser, 1997.
G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223–255, 1977.
U. S. Reddy. Global state considered unnecessary: Object-based semantics for interference-free imperative programs. Lisp and Symbolic Computation, 9(1), 1996.
J. C. Reynolds. Syntactic control of interference. In Conf. Record 5th ACM Symposium on Principles of Programming Languages, pages 39–46, 1978.
J. C. Reynolds. The essence of Algol. In Proceedings of the 1981 International Symposium on Algorithmic Languages, pages 345–372. North-Holland, 1981.
M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, 132(2):109–176, February 1997.
M. Wall and G. McCusker. A fully abstract game semantics of SCI. Draft, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McCusker, G. (2002). A Fully Abstract Relational Model of Syntactic Control of Interference. In: Bradfield, J. (eds) Computer Science Logic. CSL 2002. Lecture Notes in Computer Science, vol 2471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45793-3_17
Download citation
DOI: https://doi.org/10.1007/3-540-45793-3_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44240-0
Online ISBN: 978-3-540-45793-0
eBook Packages: Springer Book Archive