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

Chronic diseases have been around as long as humans. But now, in most industrialised nations and in many developing countries, they predominate among the leading causes of death.1 For many years… 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

Abstract The definition scheme, “A poset P is Z -inductive if it has a subposet B of Z -compact lements such that for every element of p of P there is a Z -set S in B such that p = ⨆S, becomes meaningful when we replace the symbol of Z by such adjectives as "sirected" and "chain" .Expand

In a wide variety of situations, computer science has found it convenient to define complex object as (fixed-point) solutions of certain equations.Expand

The order-theoretic enrichment of the algebraic approach to theoretical computer science, and to programming in particular, can be accomplished rather directly and elegantly, and appears to have a wide range of applications.Expand