Call-by-value games

  • Samson Abramsky
  • Guy McCusker
Conference paper

DOI: 10.1007/BFb0028004

Volume 1414 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Abramsky S., McCusker G. (1998) Call-by-value games. In: Nielsen M., Thomas W. (eds) Computer Science Logic. CSL 1997. Lecture Notes in Computer Science, vol 1414. Springer, Berlin, Heidelberg

Abstract

A general construction of models of call-by-value from models of call-by-name computation is described. The construction makes essential use of the properties of sum types in common denotational models of call-by-name. When applied to categories of games, it yields fully abstract models of the call-by-value functional language PCFv, which can be extended to incorporate recursive types, and of a language with local references as in Standard ML.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Samson Abramsky
    • 1
  • Guy McCusker
    • 2
  1. 1.Department of Computer ScienceUniversity of EdinburghEdinburghScotland
  2. 2.St John's CollegeOxfordEngland