Derivation of concurrent algorithms in Tempo

Steve Gregory, Derivation of concurrent algorithms in Tempo. Proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation (Utrecht, September 1995). ISBN 3-540-60939-3, pp. 46–60. March 1996. No electronic version available. External information


Tempo is a logic programming language that has recently been designed with the aim of allowing concurrent programs to be written in a more declarative manner than existing languages. One of the benefits of declarative programming is the potential for systematic derivation of programs -- the subject of this paper. Here we present a few transformation rules that can be applied to Tempo programs, and then describe in detail the derivation of some concurrent algorithms in Tempo. An outline of the Tempo language is also included in order to make the paper self-contained.

Bibtex entry.

Contact details

Publication Admin