Skip to main navigation Skip to search Skip to main content

Boolean-valued loops

  • Indiana University Bloomington

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

A new control structure construct, the while-until, is introduced as a syntactic combination of the while statement and the repeat-until statement. Examples show that the use of the while-until can lead to structured programs that are conceptually more manageable than those attainable without it. The while-until statement is then extended to a value-returning expression which is shown to be more powerful than the classical looping structures. It is shown to be equivalent in power to those structures with exit when a value-returning if-then-else is allowed. As a consequence, there are flowcharts whose implementations require control structures stronger than the while-until. Implementation details are discussed and Hoare-like axioms are presented. A closing discussion on oesthetics discourages some natural generalizations, but it concludes that the basic while-until is convenient for all parties on a programming team: coder, reader, compiler, and validator.

Original languageEnglish
Pages (from-to)431-451
Number of pages21
JournalBIT Numerical Mathematics
Volume15
Issue number4
DOIs
StatePublished - Dec 1975

Keywords

  • 4.12
  • 4.22
  • 4.43
  • 5.24

Fingerprint

Dive into the research topics of 'Boolean-valued loops'. Together they form a unique fingerprint.

Cite this