In Proc. 2nd IEEE Symposium on Logic in Computer Science, pages 37-44, 1987. Corrigendum, \lics3rd, 1988, page 132Paper abstract bibtex
We consider the problem of strong typing for a model of object-oriented programming systems. These systems permit values which are records of other values, and in which fields inside these records are retrieved by name. We propose a type system which allows us to classify these kinds of values and to classify programs by the type of their result, as is usual in strongly-typed programming languages. Our type system has two important properties: it admits multiple inheritance, and it has a syntactically complete type inference system.