scientific article; zbMATH DE number 3909717

From MaRDI portal
Publication:3686016





[For the entire collection see Zbl 0513.00010.] We characterize composability for algebraic implementations of abstract data types. The reason for this choice is the following: from the approaches known to me, this is the one that makes a clear distinction between syntax and semantics of implementations, allowing to study the composability problem on the appropriate setting. The paper is organized as follows, in section 1 we review the concepts of implementation and implementation correctness; in section 2, we define two kinds of composition and show counter-examples for both; section 3 is the core of the paper, results are obtained characterizing composability completely; finally, in section 4, some conclusions are proposed, comparing the results obtained here with related work. Because of space restrictions, most proofs have been omitted or are just sketched, detailed proofs may be found in the full version of this paper [Fac. d'Inf. de Barcelona, Rep. Recerca RR 82/08 (1982)].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686016)