The basic definitions are reviewed and some results are formulated relating to algebraic specification of abstract data types. The problem of recognizing sufficient completeness and the problem of finding the set of basic constructors for such specifications are considered. Effective algorithms are proposed.
|Number of pages||8|
|Journal||Programming and Computer Software|
|Publication status||Published - Jul 1984|