Abstract
Purchase PDF (3656 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (19)
doi:10.1016/S0304-3975(99)00039-0 
Copyright © 1999 Published by Elsevier Science B.V.
Contribution
Game-theoretic analysis of call-by-value computation
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Available online 13 August 1999.
Abstract
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 flow, which determines the basic form of games. In this way the call-by-name computation and call-by-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 clarified.
