A fully abstract relational model of syntactic control of interference

Research output: Chapter in Book/Report/Conference proceedingChapter

14 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationComputer Science Logic: Proceedings of 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL
EditorsJ Bradfield
Place of PublicationBerlin, Germany
PublisherSpringer
Pages247-261
Volume2471
ISBN (Electronic)978-3-540-45793-0
ISBN (Print)978-3-540-44240-0
DOIs
Publication statusPublished - 2002
Event16th International Workshop, CSL 2002 11th Annual Conference of the EACSL - Edinburgh, UK United Kingdom
Duration: 22 Sep 200225 Sep 2002

Conference

Conference16th International Workshop, CSL 2002 11th Annual Conference of the EACSL
CountryUK United Kingdom
CityEdinburgh
Period22/09/0225/09/02

Fingerprint Dive into the research topics of 'A fully abstract relational model of syntactic control of interference'. Together they form a unique fingerprint.

  • Cite this

    McCusker, G. (2002). A fully abstract relational model of syntactic control of interference. In J. Bradfield (Ed.), Computer Science Logic: Proceedings of 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL (Vol. 2471, pp. 247-261). Springer. https://doi.org/10.1007/3-540-45793-3_17