HUGHES, D. J. D. Games and definability for system F. In LICS'97 (1997), IEEE Computer Society Press, pp. 76-86. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) (Correct)
....An interesting topic in the light of such work as [32] is whether we can obtain similar principles for stateful generic processes, which we leave open in the present work. Recently, several studies of the semantics of polymorphism based on games and other intensional models have appeared. Hughes [18] presents game seman tics for polymorphism in which strategies pass arenas to implement type passing and proves full abstraction for System F, though the result arguably relies on the somewhat syntactic nature of the model. Murawski and Ong [29] substan tially simplify Hughes approach, but do ....
HUGHES, D. J. D. Games and definability for system F. In LICS'97 (1997), IEEE Computer Society Press, pp. 76-86.
Games And Definability For FPC - McCusker (1997) (1 citation) (Correct)
.... untyped and recursively typed languages [5, 4] languages with control features [21] call by value languages [13, 6] and languages with side e#ects and store [7] In a slightly di#erent vein, games models have also been discovered for the constructive classical type theory [28] and for System F [14]. Received July 11, 1997. The author acknowledges the support of Oxford University Computing Laboratory. c # 1997, Association for Symbolic Logic 1079 8986 97 0303 0004 2.60 347 348 GUY McCUSKER In this paper, we give an account of a model of FPC, a type theory with product, sum, function ....
D. Hughes, Games and definability for System F, In Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science [20], pp. 76--86.
Fully Complete Models for ML Polymorphic Types - Abramsky, Lenisa (1999) (Correct)
....is the nesting level of negative occurrences of # in the simple type T . A fully complete model for the whole system F has been provided in [BC88] but this model is built by means of a quotient on terms, and therefore it is not compositional and not su#ciently abstract. More recently, in [Hug97], a fully and faithfully complete game model for system F has been given. But, although this is a game model, it still has a syntactical flavour. Summarizing the situation, the previous work on the full completeness problem for system F has produced semantically satisfactory models only for ....
D.Hughes. Games and Definability for system F, LICS'97 Conf. Proc., 1997.
Fully Complete Models for ML Polymorphic Types - Abramsky, Lenisa (1999) (Correct)
....is the nesting level of negative occurrences of in the simple type T . A fully complete model for the whole system F has been provided in [BC88] but this model is built by means of a quotient on terms, and therefore it is not compositional and not sufficiently abstract. More recently, in [Hug97], a fully and faithfully complete game model for system F has been given. But, although this is a game model, it still has a syntactical flavour. Summarizing the situation, the previous work on the full completeness problem for system F has produced semantically satisfactory models only for ....
D.Hughes. Games and Definability for system F, LICS'97 Conf. Proc., 1997.
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