The construction of a composite type from two compatible types
is also recursively defined.
The ways compatible types can differ from each other
are due either to incomplete arrays or to old style function types.
the simplest description of the composite type
is that it is the type compatible with both
of the original types,
including every available array size
and every available parameter list from the original types.
© 2005 The SCO Group, Inc. All rights reserved.
SCO OpenServer Release 6.0.0 -- 02 June 2005