Abstract
A programming styIe is suggested which combinses the advantages of a very high-level language, SETL, and the approach of structured programming. This is achieved by first expressing algorithms in SETL then adding statements from a formally defined Data Struchue Elaboration Language to the SETL program. The result is an algorithm completely specilied in terms of logical structure and optimized implementation. The mechanization of the translation into a low-level language, is described and the programming style is illustrated with examples from the SETL compiler which, itself is written in SETL.