We consider call-by-name, call-by-value, and lazy versions of PCF, and prove, using both syntactic and semantic means, that the operational equivalences of the base language are preserved when the language is extended with sum and product types, with polymorphic types, and with recursive types. These theorems show that the type systems of the extended languages are orthogonal to the type systems of the original languages.
CITATION STYLE
Riecke, J. G., & Subrahmanyam, R. (1994). Extensions to type systems can preserve operational equivalences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 789 LNCS, pp. 76–95). Springer Verlag. https://doi.org/10.1007/3-540-57887-0_91
Mendeley helps you to discover research relevant for your work.