Type inference with constrained types

作     者：Odersky, M Sulzmann, M Wehr, M 

作者机构：Univ S Australia Sch Comp & Informat Sci The Levels SA 5095 Australia Yale Univ Dept Comp Sci New Haven CT 06520 USA Univ Edinburgh LFCS Edinburgh EH7 3JZ Midlothian Scotland 

出 版 物：《THEORY AND PRACTICE OF OBJECT SYSTEMS》 (Theor Pract Object Syst)

年 卷 期：1999年第5卷第1期

页      面：35-55页

核心收录：

主　　题：Object oriented programming 

摘      要：We present a general framework HM(X) for type systems with constraints. The framework stays in the tradition of the Hindley/Milner type system. Its type system instances are sound under a standard untyped compositional semantics. We can give a generic type inference algorithm for HM(X) so that, under sufficient conditions on X, type inference will always compute the principal type of a term. We discuss instances of the framework that deal with polymorphic records, equational theories, and subtypes. (C) 1999 John Wiley & Sons, Inc.