Equivalence of conservative, free, linear program schemas is decidable

A program schema defines a class of programs, all of which have identical statement structures, but whose expressions may differ. We prove that given any two structured schemas which are conservative, linear and free, it is decidable whether they are equivalent. [Copyright &y& Elsevier]