Abstract
A games model of a programming language with higher-order store in the style of ML-references is introduced. The category used for the model is obtained by relaxing certain behavioural conditions on a category of games previously used to provide fully abstract models of pure functional languages. The model is shown to be fully abstract by means of factorization arguments which reduce the question of definability for the language with higher-order store to that for its purely functional fragment.
Original language | English |
---|---|
Title of host publication | Proceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998 |
Publisher | IEEE |
Pages | 334-344 |
Number of pages | 11 |
Volume | 1998-June |
ISBN (Print) | 0818685069 |
DOIs | |
Publication status | Published - 1 Jan 1998 |
Event | 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998 - Indianapolis, USA United States Duration: 21 Jun 1998 → 24 Jun 1998 |
Conference
Conference | 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998 |
---|---|
Country/Territory | USA United States |
City | Indianapolis |
Period | 21/06/98 → 24/06/98 |
ASJC Scopus subject areas
- Software
- General Mathematics