Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A fully abstract game semantics for general references Samson Abramsky Kohei Honda
 

Summary: A fully abstract game semantics for general references
Samson Abramsky Kohei Honda
LFCS, University of Edinburgh
fsamson,koheig@dcs.ed.ac.uk
Guy McCusker
St John's College, Oxford
mccusker@comlab.ox.ac.uk
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.
Copyright 1998 IEEE. Published in the Proceedings of LICS'98, 21--24 June 1998 in Indianapolis, Indiana. Personal use
of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes
or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of
this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service
Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855­1331, USA. Telephone: + Intl. 732­562­3966.
1

  

Source: Abramsky, Samson - Computing Laboratory, University of Oxford
McCusker, Guy - Department of Computer Science, University of Bath

 

Collections: Computer Technologies and Information Sciences