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.
Cite
CITATION STYLE
O’Hearn, P. W., & Riecke, J. G. (1994). Fully abstract translations and parametric polymorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 788 LNCS, pp. 454–468). Springer Verlag. https://doi.org/10.1007/3-540-57880-3_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
