In [Cardelli 84] Luca Cardelli gave a formal definition of a typed object-oriented language incorporating a sub-type relation used to describe multiple inheritance. Cardelli's fundamental result was a semantics for his system that enabled sub-typing to be modelled as straightforward set-inclusion. In this paper an alternative semantics for Cardelli's system is offered in which this result is proved in a more elementary framework.
|Place of Publication||Enschede, The Netherlands|
|Publisher||University of Twente, Department of Computer Science|
|Number of pages||0|
|Publication status||Published - 1987|
- Lambda calculus
- Object-oriented programming