MURAWSKI, A., AND ONG, C.-H. L. Evolving games and essential nets for affine polymorphism. In Proc. of TLCA'01 (2001), no. 2044 in LNCS, Springer. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) (Correct)
....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 not obtain full abstraction for impred icative polymorphism. Abramsky and Lenisa [5, 6] give a fully abstract model for predicative polymorphism using interaction combinators. Treatment of impredicative polymorphism is left as an open issue. In ....
MURAWSKI, A., AND ONG, C.-H. L. Evolving games and essential nets for affine polymorphism. In Proc. of TLCA'01 (2001), no. 2044 in LNCS, Springer.
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