Full abstraction for functional languages with control

James Laird

doi:10.1109/LICS.1997.614931

Full abstraction for functional languages with control

James Laird

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

79 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 language	English
Title of host publication	Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997
Editors	Anon
Place of Publication	California, U. S. A.
Publisher	IEEE
Pages	58-67
Number of pages	10
ISBN (Print)	0818679255
DOIs	https://doi.org/10.1109/LICS.1997.614931
Publication status	Published - Dec 1997
Event	12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997 - Warsaw, Poland Duration: 29 Jun 1997 → 2 Jul 1997

Conference

Conference	12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997
Country/Territory	Poland
City	Warsaw
Period	29/06/97 → 2/07/97

Access to Document

10.1109/LICS.1997.614931

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

Cite this

@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 = dec,

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",

note = "12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997 ; Conference date: 29-06-1997 Through 02-07-1997",

}

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

AN - SCOPUS:0030708467

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.

T2 - 12th Annual IEEE Symposium on Logic in Computer Science (LICS), 1997

Y2 - 29 June 1997 through 2 July 1997

ER -

Full abstraction for functional languages with control

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this