H. John Reekie (johnr@eecs.berkeley.edu) and John Potter (johnpot.microsoft.com)
In: David Arnold (ed.), Parallel Computing and Transputers (PCAT-93), IOS Press, pp 376--383, November 1993, pp 376 -- 383.
The process network model of parallelism maps well to loosely-coupled message-passing machines. This paper uses the Haskell functional language to write process network programs, and equational program transformation techniques to alter their form and degree of parallelism. A visual syntax for Haskell is used to visualise the effects of transformationÄthe visual programs are quite similar to other ``block-diagram'' and dataflow graphical notations. As an example, an inefficient implementation of a transversal (FIR) filter is transformed into an efficient pipelined form.