Transformation strategies for deriving on line programs. (English) Zbl 0589.68010

Trees in algebra and programming, Proc. 11th Colloq., Nice/France 1986, Lect. Notes Comput. Sci. 214, 127-141 (1986).
Summary: [For the entire collection see Zbl 0578.00006.]
We consider a class of programs whose output is a sequence of ”elementary actions” or ”moves”. We provide some transformation strategies for deriving efficient iterative programs which exhibit an ”on-line behaviour”, i.e. producing the output moves, one at the time, according to a given sequence ordering. Our methods also give an answer to a long standing challenge [P. J. Hayes, Comput. J. 20, 282-385 (1977; Zbl 0362.68057)] for deriving a very fast on-line program for the Towers of Hanoi (and similarly defined) problems.


68Q60 Specification and verification (program logics, model checking, etc.)