R. Harmer and G. McCusker, A Fully Abstract Game Semantics for Finite Nondeterminism, in Proc. 14th LICS, pp. 422--430, Washington: IEEE Press, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of the early work of Milner and Plotkin. The question of higher type sequentiality and Kleene s seemingly more general problem are of fundamental importance to Computer Science. They certainly deserve further investigation. For a survey of the full abstraction problem of PCF, see e.g. [11, 23, 57]. Curien s book (second edition) 24] provides an excellent account of the main body of research inspired by the full abstraction problem of PCF. 1.5. Outline of the paper In the next section, we study the model theory of PCF in the light of standard ideas from both categorical logic and ....

P. Harmer and G. McCusker. A fully abstract game semantics for finite nondeterminism. In Proceedings of Fourteenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1999.

....languages and logical systems. It has been used to construct the first syntax independent fully abstract models for a spectrum of programming languages ranging from purely functional languages to languages with non functional features such as control operators and locally scoped references [4, 21, 5, 19, 2, 22, 17, 11]. A substantial survey of the state of the art of Game Semantics circa 1997 was given in a previous Marktoberdorf volume [6] Our aim in this tutorial presentation is to give a first indication of how Game Semantics can be developed in a new, algorithmic direction, with a view to applications in ....

R. Harmer and G. McCusker. A fully abstract game semantics for finite nondeterminism. In Proceedings of Fourteenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1999.

....extended and include recursive types [McC98] and call by value [AbrMcC1, HoYo97] Thus at least in principle the main features of languages like Scheme or Core ML (except for the ability to test references for equality) have been taken care of. Also there has been research towards nondeterminism [HaMcC99]. Very recently there has been developed a new concurrent form of game semantics resolving problems posed by the sequentiality of the traditional ones and giving a full completeness result for multiplicative additive linear logic [AbrMel99, Abr99c] Also, game semantics has been employed to ....

R. Harmer, G. McCusker, A fully abstract game semantics for finite nondeterminism, in: Proceedings of the Fourteenth International Symposium on Logic in Computer Science, Computer Society Press of the IEEE 1999

....x =#. Then # is in every [ M (n) #) Since no [ V ] #) is # at ground types (actually at all types) it follows that no M (n) is total and hence that M ## n . Essentially this result is in [29] and a stronger one for both call by name and call by value is in [10] see [3, 11, 9] for work on call by name and nondeterminism. One can presumably also prove an adequacy theorem at other types, but the statement is more complex due to need for closure operators in the set theoretic representation of powerdomains, and there is some work to be done in extending the theory of ....

R. Harmer and G. McCusker, A Fully Abstract Game Semantics for Finite Nondeterminism, in Proc. 14th LICS, pp. 422--430, Washington: IEEE Press, 1999.

.... state of the art Games models have been built for higher order programming languages with a variety of computational features: pure functional languages (PCF) 1, 8, 12] store (Idealized Algol) 3] operators (SPCF, exceptions) 9] store (pointers) 2] [7] Semantics: an Overview Full abstraction many cases, the models completely characterize those behaviours which can be programmed in the language: results hold. Whenever a definability result holds, it is possible to achieve full abstraction: after a straightforward ....

Russell Harmer and Guy McCusker. A fully abstract game semantics for finite nondeterminism. In Proceedings, Fourteenth Annual IEEE Symposium on Logic in Computer Science, pages 422--430, 1999.

....get the result 1. If, on the other hand, it is meant only that either can happen but we don t know which then the only consistent answer is to say that we may get 1 but we also may diverge. This latter meaning was investigated in a recent games model for nondeterminism by Harmer McCusker [12]. In this paper, we construct a games model of the former by developing a suitable notion of probabilistic strategy. One motivation for doing this is to give a means of understanding quantitative aspects of uncertainty that might arise in the description of a process. Dually, inherently ....

....in that particular case, the so called intrinsic equivalence in the intensional model has a simple concrete characterization. If solved to the positive, that could relate to formal methods in programming. A more theoretical question is that of relating our model to Harmer McCusker s model [12]. There is an obvious embedding of theirs into ours, based on an equal chances interpretation of non determinism, but it isn t fully abstract, as the opening example clearly shows. Another possibility is the investigation of a timeless version of our model in the spirit of the Baillot, Danos, ....

[Article contains additional citation context not shown here]

R. Harmer and G. McCusker. A fully abstract game semantics for finite nondeterminism. In Proceedings, Fourteenth AnnualIEEE Symposiumon Logic in Computer Science. IEEE Computer Society Press, 1999.

....get the result 1. If, on the other hand, it is meant only that either can happen but we don t know which then the only consistent answer is to say that we may get 1 but we also may diverge. This latter meaning was investigated in a recent games model for nondeterminism by Harmer McCusker [12]. In this paper, we construct a games model of the former by developing a suitable notion of probabilistic strategy. One motivation for doing this is to give a means of understanding quantitative aspects of uncertainty that might arise in the description of a process. Dually, inherently ....

....in that particular case, the so called intrinsic equivalence in the intensional model has a simple concrete characterization. If solved to the positive, that could relate to formal methods in programming. A more theoretical question is that of relating our model to Harmer McCusker s model [12]. There is an obvious embedding of theirs into ours, based on an equal chances interpretation of non determinism, but it isn t fully abstract, as the opening example clearly shows. Another possibility is the investigation of a timeless version of our model in the spirit of the Baillot, Danos, ....

[Article contains additional citation context not shown here]

R. S. Harmer and G. A. McCusker. A fully abstract game semantics for finite nondeterminism. In Proceedings, Fourteenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1999.

No context found.

R. Harmer and G. McCusker, A Fully Abstract Game Semantics for Finite Nondeterminism, in Proc. 14th LICS, pp. 422--430, Washington: IEEE Press, 1999.

No context found.

R. Harmer,G.McCusker, A fully abstract game semantics for finite nondeterminism, in: Proceedings of the Fourteenth International Symposium on Logic in Computer Science, Computer Society Press of the IEEE 1999

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC