Axiomatic equivalence of programs with structured variables
Christoph M. Hoffman, Lawrence H. Landweber · 1974
A program schema which models straight line code admitting structured variables such as arrays, lists, queues etc. is considered. A set of expressions is associated with a program reflecting the inputoutput transformations. Given a set of basic axioms defining expression equivalence the class of programs with equivalent expression sets is characterized by a minimal complete set of equivalence preserving transformations on programs.