S.Abramsky,R.Jagadeesan,P.Malacaria, Full abstraction for PCF, accepted by: Information and Computation Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Games in the Semantics of Programming Languages - An Elementary.. - Jürjens (1999) (Correct)
....involved (this will be made more precise below) 110 JAN J URJENS 3. DEFINITIONS To put the above intuitive examples on a more solid foundation, we will now provide the underlying definitions. They appeared in [McC98] and are essentially an adaption of [HylOng1] taking account of ideas in [AbrJagMal1]. 3.1. Games and Strategies. Definition 1. An arena is a structure A = MA ; A ; A ) consisting of ffl a set of moves MA , ffl the labelling function A : MA fS; Eg Theta fQ; Ag (call moves labelled (S; l) resp. E; l) for l 2 fQ; Ag) S moves resp. E moves and moves labelled (l; Q) ....
S. Abramsky, R. Jagadeesan, P. Malacaria, Full abstraction for PCF, accepted by: Information and Computation
Games in the Semantics of Programming Languages - An Elementary.. - Jürjens (1999) (Correct)
No context found.
S.Abramsky,R.Jagadeesan,P.Malacaria, Full abstraction for PCF, accepted by: Information and Computation
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