On hierarchies of abstract data types

Algebraic definition of a functional programming language and its semantic models

“…For simplicity, however, we consider in the following only types (S, E, P) with a nonhierarchical primitive subtype P = (L', E')\ ail défini-tions and properties carry easily over in the gênerai case {cf. also Wirsing et al [33]). …”

“…Guttag [20]) can be generalized to types (cf Wirsing, et ai [33]). Because of our approach of partial algebras ail functions ƒ : s x x ... x s n -> s n + i are strict: For ail terms t u .…”

“…Then T=(X, E, (E', £')) is called a hierarchical type, cf. Wirsing et ai [33]. This définition can easily be generalized to several primitive subtypes P u ...,P n and to hierarchical subtypes.…”

Transforming functional signatures of algebraic specifications into object-oriented class signatures

“…The hierarchical approach to abstract data types were first studied in [22] to which we refer for further details. The transformation depends on the positions of the nonprimitive sorts in the domain resp.…”

“…detU( f ) = true (22) We uniformly select the first occurrence of the nonprimitive sort stack in the domain of regular function symbols R = T∪ O as single-receiver parameter:…”