An overview of initial algebra semantics which permits unified algebraic treatment of iterative and recursive semantic features in the same framework as basic operations.Expand

Abstract This paper is concerned mainly with classes (categories) of ordered algebras which in some signature are axiomatizable by a set of inequations between terms (‘varieties’ of ordered algebras)… Expand

This paper extends our earlier work on abstract data types by providing an algebraic treatment of parametrized data types (e.g., sets-of-(), stacks-of, etc.Expand

We investigate the "hidden function" problem (the need to include operat ions in specifications which we want to be hidden from the user); we prove that condit ional specifications are inherently more powerful than equational specifications; we compare the power of the algebraic approach taken here with the categorical approach of Lehman and Smyth .Expand