A fully abstract relational model of syntactic control of interference

Guy McCusker

doi:10.1007/3-540-45793-3_17

A fully abstract relational model of syntactic control of interference

Guy McCusker

Research output: Chapter or section in a book/report/conference proceeding › Chapter or section

14 Citations (SciVal)

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 language	English
Title of host publication	Computer Science Logic: Proceedings of 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL
Editors	J Bradfield
Place of Publication	Berlin, Germany
Publisher	Springer
Pages	247-261
Volume	2471
ISBN (Electronic)	978-3-540-45793-0
ISBN (Print)	978-3-540-44240-0
DOIs	https://doi.org/10.1007/3-540-45793-3_17
Publication status	Published - 2002
Event	16th International Workshop, CSL 2002 11th Annual Conference of the EACSL - Edinburgh, UK United Kingdom Duration: 22 Sept 2002 → 25 Sept 2002

Conference

Conference	16th International Workshop, CSL 2002 11th Annual Conference of the EACSL
Country/Territory	UK United Kingdom
City	Edinburgh
Period	22/09/02 → 25/09/02

Access to Document

10.1007/3-540-45793-3_17

Cite this

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 or section in a book/report/conference proceeding › Chapter or section

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. https://doi.org/10.1007/3-540-45793-3_17

@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{\textquoteright}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{\textquoteright}s object spaces model, so this work also shows that Reddy{\textquoteright}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",

note = "16th International Workshop, CSL 2002 11th Annual Conference of the EACSL ; Conference date: 22-09-2002 Through 25-09-2002",

}

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 or section

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

A2 - Bradfield, J

PB - Springer

CY - Berlin, Germany

T2 - 16th International Workshop, CSL 2002 11th Annual Conference of the EACSL

Y2 - 22 September 2002 through 25 September 2002

ER -

A fully abstract relational model of syntactic control of interference

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this