Derivation of efficient programs for computing sequences of actions

AbstractWe consider a class of programs whose output is a sequence of elementary actions or moves. For that class we provide some transformation strategies for deriving efficient iterative programs with on-line behaviour, that is, programs which produce the output moves, one at the time, according to a given sequence ordering.Using the proposed methods it is possible to answer Hayes' long-standing challenge for deriving a very fast on-line program for the Towers of Hanoi and similarly defined problems