Object-oriented Programming Model Research Articles

Type inference for record concatenation and multiple inheritance

We show that the type inference problem for a lambda calculus with records, including a record concatenation operator, is decidable. We show that this calculus does not have principal types, but does have finite complete sets of types: that is, for any term M in the calculus, there exists an effectively generable finite set of type schemes such that every typing for M is an instance of one of the schemes in the set. We show how a simple model of object-oriented programming, including hidden instance variables and multiple inheritance, may be coded in this calculus. We conclude that type inference is decidable for object-oriented programs, even with multiple inheritance and classes as first-class values.

The COIN model for concurrent computation and its implementation

COIN is a model for object-oriented programming with special emphasis on concurrent and distributed systems. It was developed to integrate design, implementation, and visualization of distributed applications. The distinguishing characteristics of COIN are: a) hierarchial object structures; b) multiple explicit object interfaces; c) explicit and dynamic binding of interface operations to operation implementations; d) generation of structures consisting of several objects and their interconnections as an atomic action. The paper gives an overview of the COIN model and its implementation in the COIN/L programming language.