• DocumentCode
    1956894
  • Title

    A fully abstract game semantics for general references

  • Author

    Abramsky, Samson ; Honda, Kohei ; McCusker, Guy

  • Author_Institution
    Lab. for Found. of Comput. Sci., Edinburgh Univ., UK
  • fYear
    1998
  • fDate
    21-24 Jun 1998
  • Firstpage
    334
  • Lastpage
    344
  • 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
  • Keywords
    formal languages; game theory; programming languages; ML-references; category; factorization arguments; fully abstract; games model; higher-order store; programming language; Calculus; Computer languages; Educational institutions; Joining processes; Prototypes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on
  • Conference_Location
    Indianapolis, IN
  • ISSN
    1043-6871
  • Print_ISBN
    0-8186-8506-9
  • Type

    conf

  • DOI
    10.1109/LICS.1998.705669
  • Filename
    705669
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1956894