Normal forms for algebraic specifications of reusable Ada packages

This paper introduces the concept of normal forms for algebraic specifications of Ada packages defining abstract data types. The normal form is used in the process of reusable software component retrieval via formal specifications. We review the use of algebras for the specification of abstract data types. Then, using a concrete example, we define normal forms and present the details of algorithms to automate the normalization process.