an extension of system strongfstrong with subtyping - hp labs.pdf

An extension of system F with subtyping Luca Cardelli 1 Simone Martini 2 John C. Mitchell 3 Andre Scedrov 4 Abstract System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F , called F : (pronounced ef-sub) that combines parametric polymorphism with subtyping. The main focus of the paper is the equational theory of F : , which is related to PER models and the notion of parametricity. We study some categorical properties of the theory when restricted to closed terms, including interesting categorical isomorphisms. We also investigate proof- theoretical properties, such as the conservativity of typing judgments with respect to F . We demonstrate by a set of examples how a range of constructs may be encoded in F : . These include record operations and subtyping hierar- chies that are related to features of object-oriented languages. Appears in: International Conference on Theoretical Aspects of Computer Software, T.Ito, A.R.Meyer Eds., Lecture Notes in Computer Science n. 526, pp 750-770, Springer Verlag, 1991. Also to appear in Information Computation. SRC Research Report 80, December 30, 1991. Revised January 1, 1993.  Digital Equipment Corporation 1991,1993. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of the Systems Research Center of Digital Equipment Corporation in Palo Alto, California; an acknowledgment of