An algorithm to recognize sufficient completeness of algebraic specification of an abstract data type (Q2265802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to recognize sufficient completeness of algebraic specification of an abstract data type |
scientific article; zbMATH DE number 3892574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm to recognize sufficient completeness of algebraic specification of an abstract data type |
scientific article; zbMATH DE number 3892574 |
Statements
An algorithm to recognize sufficient completeness of algebraic specification of an abstract data type (English)
0 references
1984
0 references
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.
0 references
algebraic specification of abstract data types
0 references
completeness
0 references
0.8060587644577026
0 references
0.7878325581550598
0 references
0.7825276255607605
0 references
