Abramsky, S., and Lenisa, M. Axiomatizing fully complete models for ML polymorphic types. In Proc. of MFCS'2000 (2000). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) (Correct)
....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] substantially simplify Hughes approach, but do not obtain full abstraction for impredicative 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 view of the relationship between calculi and game semantics [9, 16, 19] it would be interesting to use typed processes in the present ....
Abramsky, S., and Lenisa, M. Axiomatizing fully complete models for ML polymorphic types. In Proc. of MFCS'2000 (2000).
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) (Correct)
....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 view of the relationship between r calculi and game semantics [9, 16, 19] it would be interesting to use typed processes in the present ....
ABRAMSKY, S., AND LENISA, M. Axiomatizing fully complete models for ML polymorphic types. In Proc. of MFCS'2000 (2000).
Genericity and the pi-Calculus - Berger, Honda, Yoshida (2 citations) (Correct)
....type passing and proves full abstraction for System F. His model is somewhat complex due to its direct representation of type instantiation. Murawski and Ong [21] substantially simplify Hughes approach, but do not obtain full abstraction for impredicative polymorphism. Abramsky and Lenisa [3, 4] give a fully abstract model for predicative polymorphism using interaction combinators. Treatment of impredicative polymorphism is left as an open issue. In view of the relationship between calculi and game semantics [7, 11, 14] it would be interesting to use typed processes from the present ....
Abramsky, S., and Lenisa, M. Axiomatizing fully complete models for ML polymorphic types. In Proc. of MFCS'2000 (2000).
Genericity and the π-Calculus - Berger, Honda, Yoshida (Correct)
No context found.
Abramsky, S., and Lenisa, M. Axiomatizing fully complete models for ML polymorphic types. In Proc. of MFCS'2000 (2000).
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