Meltzer, Bernard




Machine Intelligence 4

Classics

Several workers in recent years have considered using techniques and ideas of various mathematical theories of computation for proving interesting results about computer programs. These predicates may be thought of as expressing the relevant relations between the values of the variables of interest at the given point; in particular, the predicate on the exit point represents the property of the program we wish to prove. In a program scheme we have a set of registers L1, L2,.. L„, a set of function names ft,,f2, -. fp, and a set of test names ti, t2,..