The utility of repetitive constructs is challenged. Recursive refinement is claimed to be
semantically as simple, and superior for programming ease and clarity. Some programming
examples are offered to support this claim. The relation between the semantics of predicate
transformers and “least fixed point” semantics is presented.