A Look at Algebraic Specifications (Mathematical Studies of Information Processing)
Stephen N. Zills · Institutional Repositories DataBase (IRDB) · 1982
Being able to specify exactly the properties required of the data used by an abstract algorithm is important in defining highly reusable routines.This paper begins with an introduction to the use of algebras in specifying data types.The notion of what a many sorted algebra is and why they are useful in defining data is reviewed Then the two major approaches to specifying a class of algebra $s$ are discussed.Finally, a language for writing well structured specifications is presented with numerous examples.This language is being used in a project that is defining and designing an implementation for highly reusable program units.