Paper: Complete Type Inference for Simple Objects (at LICS 1987)

Authors: Mitchell Wand

Abstract

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.

BibTeX

  @InProceedings{Wand-CompleteTypeInferen,
    author = 	 {Mitchell Wand},
    title = 	 {Complete Type Inference for Simple Objects},
    booktitle =  {Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science (LICS 1987)},
    year =	 {1987},
    month =	 {June}, 
    pages =      {37--44 },
    location =   {Ithaca, NY, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }