On the automatic simplification of computer programs
J. Nievergelt · Communications of the ACM · 1965
Presented in this paper is the problem of writing a program which would examine any other program and perform such simplifications on it as can be detected from the argumentprogram's form alone, without having any knowledge of what it is supposed to do.