Composition Languages for Black-Box Components

Wuyts, Roel; Ducasse, Stéphane (2001). Composition Languages for Black-Box Components. In: OOPSLA Workshop on Language Mechanisms for Programming Software Components. Tampa, Florida. 15. Okt. 2001.

[img] Text
Wuyt01c.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (67kB) | Request a copy

Supporting reuse of existing pieces of code is one of the main goals of software engineering. In the name of reuse, module-based programming languages came to be, only to be surpassed by object-oriented technology. With the same motivation component-based solutions are overtaking object-oriented solutions. However, the delegation-only focus of component-based programming risks of resulting in the same problems that modular-based approaches ran into. To counter this, we claim that one of th e important problems that should be addressed by component languages is the composition of components. More specifically, we see component languages where components are black-box abstractions, and with (one or more) composition languages to glue them tog ether. As an example we show a functional (Piccola) and a logic (QSoul) composition approach.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF)
08 Faculty of Science > Institute of Computer Science (INF) > Software Composition Group (SCG)

UniBE Contributor:

Ducasse, Stephane

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

Language:

English

Submitter:

Manuela Bamert

Date Deposited:

31 Jan 2018 08:50

Last Modified:

21 Nov 2019 00:41

BORIS DOI:

10.7892/boris.104813

URI:

https://boris.unibe.ch/id/eprint/104813

Actions (login required)

Edit item Edit item
Provide Feedback