Abstract for "Extensions to Type Systems Can Preserve Operational Equivalences"
Extensions to Type Systems Can Preserve Operational Equivalences
Jon G. Riecke and Ramesh Subrahmanyam. Appeared in Proceedings of the International Symposium on Theoretical Aspects of Computer Software, volume 789 of Lecture Notes in Computer Science, pages 76-95. Springer Verlag, 1994.

Abstract: 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.