Object composition

Summary

In computer science, object composition and object aggregation are closely related ways to combine objects or data types into more complex ones. In conversation the distinction between composition and aggregation is often ignored. Common kinds of compositions are objects used in object-oriented programming, tagged unions, sets, sequences, and various graph structures. Object compositions relate to, but are not the same as, data structures. Object composition refers to the logical or conceptual structure of the information, not the implementation or physical data structure used to represent it. For example, a sequence differs from a set because (among other things) the order of the composed items matters for the former but not the latter. Data structures such as arrays, linked lists, hash tables, and many others can be used to implement either of them. Perhaps confusingly, some of the same terms are used for both data structures and composites. For example, "binary tree" can refer

Official source

https://en.wikipedia.org/wiki/Object_composition

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (4)

Related publications

Related people

Related units

Related concepts (23)

Related concepts

Related courses (3)

Related courses

Related lectures (2)

Related lectures

A Cognitive Reference Based Model for Learning Compositional Hierarchies with Whole-Composite Tags

Ashish Kishore Bindal, Anshuman Bahadur Saxena, Alain Wegmann

A compositional hierarchy is the default organization of knowledge acquired for the purpose of specifying the design requirements of a service. Existing methods for learning compositional hierarchies from natural language text, interpret composition as an exclusively propositional form of part-whole relations. Nevertheless, the lexico-syntactic patterns used to identify the occurrence of part-whole relations fail to decode the experientially grounded information, which is very often embedded in various acts of natural language expression, e.g. construction and delivery. The basic idea is to take a situated view of conceptualization and model composition as the cognitive act of invoking one category to refer to another. Mutually interdependent set of categories are considered conceptually inseparable and assigned an independent level of abstraction in the hierarchy. Presence of such levels in the compositional hierarchy highlight the need to model these categories as a unified-whole wherein they can only be characterized in the context of the behavior of the set as a whole. We adopt an object-oriented representation approach that models categories as entities and relations as cognitive references inferred from syntactic dependencies. The resulting digraph is then analyzed for cyclic references, which are resolved by introducing an additional level of abstraction for each cycle.

2013

Ada 83 did not provide enough control on the creation, assignment, and destruction of objects of user-defined types. This lack of control restricted type composition and prevented the full exercise of information hiding on Abstract Data Types. Ada 9X brings new mechanisms supporting the full control of Abstract Data Types, powerful type composition, and more extensive information hiding. With better control of Abstract Data Types, Ada code will be easier to write, understand, and reuse. Thus, applications written in Ada 9X will be safer. Keywords: Abstract data types, Information hiding, Ada 9X, Object initialization, User-defined Assignment, Object finalization, Memory Reclamation, Reference counting, Type composition.

ACM Press1994

Type-based composition of information services in large scale environments

Ion Constantinescu, Boi Faltings

2004