Let V be the sort set of D, and let
be its signature. Elements of V are called
visible sorts,
and
is called the visible signature.
Effective verification of a system will require an effective specification of its data algebra. We will assume that the data algebra is specified by an OBJ "object;" this means we have initial algebra semantics, which also supports proofs by induction.