A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Game theoretic analysis of call-by-value computation
[chapter]
1997
Lecture Notes in Computer Science
We present a general semantic universe of call-by-value computation based on elements of game semantics, and validate its appropriateness as a semantic universe by the full abstraction result for call-by-value PCF, a generic typed programming language with call-by-value evaluation. The key idea is to consider the distinction between call-by-name and call-by-value as that of the structure of information ow, which determines the basic form of games. In this way call-by-name computation and
doi:10.1007/3-540-63165-8_180
fatcat:dnl3jofkrrbmlfg3eydlmb2rii