A fully abstract relational model of syntactic control of interference

Research output: Chapter in Book/Report/Conference proceedingChapter

  • 14 Citations

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.
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
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

Syntactics
Computer programming languages

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). Berlin, Germany: Springer. DOI: 10.1007/3-540-45793-3_17

A fully abstract relational model of syntactic control of interference. / McCusker, Guy.

Computer Science Logic: Proceedings of 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL. ed. / J Bradfield. Vol. 2471 Berlin, Germany : Springer, 2002. p. 247-261.

Research output: Chapter in Book/Report/Conference proceedingChapter

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, Springer, Berlin, Germany, pp. 247-261, 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL , Edinburgh, UK United Kingdom, 22/09/02. DOI: 10.1007/3-540-45793-3_17
McCusker G. A fully abstract relational model of syntactic control of interference. In Bradfield J, editor, Computer Science Logic: Proceedings of 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL. Vol. 2471. Berlin, Germany: Springer. 2002. p. 247-261. Available from, DOI: 10.1007/3-540-45793-3_17
McCusker, Guy. / A fully abstract relational model of syntactic control of interference. Computer Science Logic: Proceedings of 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL. editor / J Bradfield. Vol. 2471 Berlin, Germany : Springer, 2002. pp. 247-261
@inbook{b5116ac95adc4007b952da03e43b8786,
title = "A fully abstract relational model of syntactic control of interference",
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.",
author = "Guy McCusker",
year = "2002",
doi = "10.1007/3-540-45793-3_17",
language = "English",
isbn = "978-3-540-44240-0",
volume = "2471",
pages = "247--261",
editor = "J Bradfield",
booktitle = "Computer Science Logic: Proceedings of 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL",
publisher = "Springer",

}

TY - CHAP

T1 - A fully abstract relational model of syntactic control of interference

AU - McCusker,Guy

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://dx.doi.org/10.1007/3-540-45793-3_17

U2 - 10.1007/3-540-45793-3_17

DO - 10.1007/3-540-45793-3_17

M3 - Chapter

SN - 978-3-540-44240-0

VL - 2471

SP - 247

EP - 261

BT - Computer Science Logic: Proceedings of 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL

PB - Springer

CY - Berlin, Germany

ER -