Results 1 
2 of
2
Game Theoretic Analysis Of CallByValue Computation
, 1997
"... . We present a general semantic universe of callbyvalue computation based on elements of game semantics, and validate its appropriateness as a semantic universe by the full abstraction result for callbyvalue PCF, a generic typed programming language with callbyvalue evaluation. The key idea is ..."
Abstract

Cited by 60 (20 self)
 Add to MetaCart
. We present a general semantic universe of callbyvalue computation based on elements of game semantics, and validate its appropriateness as a semantic universe by the full abstraction result for callbyvalue PCF, a generic typed programming language with callbyvalue evaluation. The key idea is to consider the distinction between callbyname and callbyvalue as that of the structure of information flow, which determines the basic form of games. In this way the callbyname computation and callbyvalue 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 callbyname universe is also clarified. 1. Introduction The callbyvalue is a mode of calling procedures widely used in imperative and function...
A Survey of Categorical Computation: Fixed Points, . . .
, 1990
"... Machine by Curien [Cur86]. It is based upon a weak categorical combinatory logic, viz. lacking surjective pairing and extensionality, that arose as a direct semantictosyntactic translation of the lambda calculus of tuples. The computational mode was combinator term reduction through rewriting usin ..."
Abstract
 Add to MetaCart
Machine by Curien [Cur86]. It is based upon a weak categorical combinatory logic, viz. lacking surjective pairing and extensionality, that arose as a direct semantictosyntactic translation of the lambda calculus of tuples. The computational mode was combinator term reduction through rewriting using a direct lefttoright parse algorithm, initially making the evaluation strategy inefficiently eager 1 . Application is therefore simply juxtaposition, losing the full expressiveness ofreduction that computes via substitution. Its overly strong bias towards the lambda calculus was another factor that limited its expressiveness. On one hand the CAM demanded the existence of categorical products but on the other it had no coproducts for developing many useful data structures. Nevertheless, the high acceptance and efficiency of the CAMbased ML compiler, CAML, gives significant encouragement towards developing a highlyprogrammable categorical computing paradigm. Some prominent workers in ...