Game theoretic analysis of call-by-value computation [chapter]

Kohei Honda, Nobuko Yoshida
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
more » ... -value computation arise as two independent instances of sequential functional computation with distinct algebraic structures. We elucidate the type structures of the universe following the standard categorical framework developed in the context of domain theory. Mutual relationship between the presented category of games and the corresponding call-by-name universe is also clari ed.
doi:10.1007/3-540-63165-8_180 fatcat:dnl3jofkrrbmlfg3eydlmb2rii