We study a minimal extension of the Hindley/Milner system that supports overloading and polymorphic records. We show that the type system is sound with respect to a standard untyped compositional semantics. We also show that every typable term in this system has a principal type and give an algorithm to reconstruct that type.
|Title of host publication||FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture|
|Number of pages||12|
|Publication status||Published - 1995|