A semantics of object-oriented sets
Herman Balsters, C.C. de Vreeze · University of Twente Research Information · 1992
An account is given of extending the well-known object-oriented type system of Luca Cardelli with set constructs and logical formalism. The system is based on typed -notation, employing a subtyping relation and a powertype construct. Sets in this system are value expressions and are typed as some powertype. Sets are built up in a very general manner; in particular, sets can be described by (first-order) predicates. The resulting system, called LPT, is statically typecheckable (in a context of multiple inheritance) and is provided with a set-theoretic semantics. LPT can be used as a mathematical foundation for an object-oriented data model employing sets and constraints. 1 Introduction and results In object-oriented database systems, object-oriented programming is merged with object-oriented datastructuring, enabling the designer of a database to have all the advantages of a clean conceptual design, as well as the possibility of enforcing better software engineering. Cardelli [1] argue...