Abstract for "Fully Abstract Translations and Parametric Polymorphism"
Fully Abstract Translations and Parametric Polymorphism
Peter W. O'Hearn and Jon G. Riecke. Appeared in Proceedings of the Fifth European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 454-468. Springer Verlag, 1994.

Abstract: We examine three languages: call-by-name PCF; an idealized version of Algol called IA; and a call-by-name version of the functional core of ML with a parallel conditional, called PPCF+XML. Syntactic translations from PCF and IA into PPCF+XML are given and shown to be fully abstract, in the sense that they preserve and reflect observational equivalence. We believe that these results suggest the potential unifying force of Strachey's concept of parametric polymorphism.