Full abstraction for functional languages with control

Research output: Chapter in Book/Report/Conference proceedingConference contribution

77 Citations (Scopus)

Abstract

This paper considers the consequences of relaxing the bracketing condition on `dialogue games', showing that this leads to a category of games which can be `factorized' into a well-bracketed substructure, and a set of classically typed morphisms. These are shown to be sound denotations for control operators, allowing the factorization to be used to extend the definability result for PCF to one for PCF with control operators at atomic types. Thus we define a fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games.

Original languageEnglish
Title of host publicationProceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997
Editors Anon
Place of PublicationCalifornia, U. S. A.
PublisherIEEE
Pages58-67
Number of pages10
ISBN (Print)0818679255
DOIs
Publication statusPublished - Dec 1997
Event12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997 - Warsaw, Poland
Duration: 29 Jun 19972 Jul 1997

Conference

Conference12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997
CountryPoland
CityWarsaw
Period29/06/972/07/97

Fingerprint

Factorization
Mathematical operators
Acoustic waves

Cite this

Laird, J. (1997). Full abstraction for functional languages with control. In Anon (Ed.), Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997 (pp. 58-67). California, U. S. A.: IEEE. https://doi.org/10.1109/LICS.1997.614931

Full abstraction for functional languages with control. / Laird, James.

Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997. ed. / Anon. California, U. S. A. : IEEE, 1997. p. 58-67.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Laird, J 1997, Full abstraction for functional languages with control. in Anon (ed.), Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997. IEEE, California, U. S. A., pp. 58-67, 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997, Warsaw, Poland, 29/06/97. https://doi.org/10.1109/LICS.1997.614931
Laird J. Full abstraction for functional languages with control. In Anon, editor, Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997. California, U. S. A.: IEEE. 1997. p. 58-67 https://doi.org/10.1109/LICS.1997.614931
Laird, James. / Full abstraction for functional languages with control. Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997. editor / Anon. California, U. S. A. : IEEE, 1997. pp. 58-67
@inproceedings{ec533b2f011c4800ac3e221886f0d744,
title = "Full abstraction for functional languages with control",
abstract = "This paper considers the consequences of relaxing the bracketing condition on `dialogue games', showing that this leads to a category of games which can be `factorized' into a well-bracketed substructure, and a set of classically typed morphisms. These are shown to be sound denotations for control operators, allowing the factorization to be used to extend the definability result for PCF to one for PCF with control operators at atomic types. Thus we define a fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games.",
author = "James Laird",
year = "1997",
month = "12",
doi = "10.1109/LICS.1997.614931",
language = "English",
isbn = "0818679255",
pages = "58--67",
editor = "Anon",
booktitle = "Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997",
publisher = "IEEE",
address = "USA United States",

}

TY - GEN

T1 - Full abstraction for functional languages with control

AU - Laird, James

PY - 1997/12

Y1 - 1997/12

N2 - This paper considers the consequences of relaxing the bracketing condition on `dialogue games', showing that this leads to a category of games which can be `factorized' into a well-bracketed substructure, and a set of classically typed morphisms. These are shown to be sound denotations for control operators, allowing the factorization to be used to extend the definability result for PCF to one for PCF with control operators at atomic types. Thus we define a fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games.

AB - This paper considers the consequences of relaxing the bracketing condition on `dialogue games', showing that this leads to a category of games which can be `factorized' into a well-bracketed substructure, and a set of classically typed morphisms. These are shown to be sound denotations for control operators, allowing the factorization to be used to extend the definability result for PCF to one for PCF with control operators at atomic types. Thus we define a fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games.

UR - http://www.scopus.com/inward/record.url?scp=0030708467&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1109/LICS.1997.614931

U2 - 10.1109/LICS.1997.614931

DO - 10.1109/LICS.1997.614931

M3 - Conference contribution

SN - 0818679255

SP - 58

EP - 67

BT - Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997

A2 - Anon, null

PB - IEEE

CY - California, U. S. A.

ER -