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 | |
| 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 | Poland |
| City | Warsaw |
| Period | 29/06/97 → 2/07/97 |
Fingerprint Dive into the research topics of 'Full abstraction for functional languages with control'. Together they form a unique fingerprint.
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). IEEE. https://doi.org/10.1109/LICS.1997.614931