S. Abramsky, R. Jagadeesan, and P. Malacaria. Games and full abstraction for PCF: preliminary announcement. Unpublished, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....DCPO de ned in [36] Call by value monads are, however, de ned over call by value models, not over categories. There is a good reason for this: constructing categories suitable for sequential languages like VPCF (see, e.g. 3, 4, 6] has been open for many years (although recent announcements [2, 15, 26] suggest that a categorical framework can be constructed) Moreover, by de ning call by value monads over models, we can state and prove our results independent of the details of the construction of any particular model. Our de nition of a call by value monad is inspired by the notion of a ....

S. Abramsky, R. Jagadeesan, and P. Malacaria. Games and full abstraction for PCF: preliminary announcement. Unpublished, 1993.

....DCPO defined in [36] Call by value monads are, however, defined over call by value models, not over categories. There is a good reason for this: constructing categories suitable for sequential languages like VPCF (see, e.g. 3, 4, 6] has been open for many years (although recent announcements [2, 15, 26] suggest that a categorical framework can be constructed) Moreover, by defining call by value monads over models, we can state and prove our results independent of the details of the construction of any particular model. Our definition of a call by value monad is inspired by the notion of a ....

S. Abramsky, R. Jagadeesan, and P. Malacaria. Games and full abstraction for PCF: preliminary announcement. Unpublished, 1993.

....in the full type hierarchy over a finite base type, is interesting but apparently not immediately relevant to the PCF definability problem. The results of this paper were obtained subsequent to the full abstraction results reported by Abramsky, Jagadeesan and Malacaria (Abramsky et al. 1994; Abramsky et al. 1993) and Hyland and Ong (Hyland and Ong, 1993) using games semantics. The games semantics approaches the full abstraction problem for PCF by first providing an intensional model, which is then quotiented to achieve extensionality. In contrast, here and in (Sieber, 1992) the starting point is ....

Abramsky, S., Jagadeesan, R., and Malacaria, P. (1993). Games and full abstraction for PCF: preliminary announcement. Communicated to the TYPES electronic mail list, July 23, 1993.

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