Complete Type Inference for Simple Objects
Proc 2nd IEEE Symposium on Logic in Computer Science (1987)
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.
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
5 Readers on Mendeley
by Discipline
by Academic Status
60% Ph.D. Student
20% Student (Master)
20% Researcher (at an Academic Institution)
by Country
20% Lithuania
20% Turkey
20% Canada
Groups
 |