Abstract

We study a minimal extension of the Hindley/Milner system that supports overloading and polymorphic records. We also show that every typable term in this system has a principal type and give an algorithm to reconstruct that type. We give the proofs for termination, soundness and correctness for the constrained unification and the type reconstruction algorithm. Here you can find the full proof for termination, soundness and correctness of the type reconstruction algorithm of system O. If you are interested in a dynamic semantics and a denotational semantics for system O and the connection to polymorphic records take a look in [OWW95]. This paper contains the definition of system O, the definition of its type reconstruction algorithm, all notions to define the properties of type reconstruction and the proofs of all properties. The proofs are inspired by the techniques used in [Che94] and [Jon92]. The first section defines the language and the type system which is an extension of the Hin...

Citations