Skip to Main Content
A mathematical formalism is described through which a program is given a symbolic representation and, with the application of several basic formulas, may be transformed into an equivalent representation giving rise to a reorganized program. Examples are given in which programs are simplified (e.g., code is reduced) or reorganized into a structured form. In effect a mathematics is described that applies to programs in much the same manner as Boolean algebra applies to switching circuits.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.