Abstract

this paper also the quite elegant case notation for the definition of functions over data types. He also discussed the general method of structural induction for proving properties of programs which manipulate such data types. This was further analyzed in Hoare's paper on recursive data structures [13]. Earlier, McCarthy and Painter [27] had used structural induction for proving the correctness of a compiler for arithmetic expressions.