Topological skeletons in Haskell/sub #/

Algorithmic skeletons is a powerful concept to describe patterns of concurrency in programming, abstracting from implementation. Haskell/sub #/ is a coordination based distributed extension of Haskell. In this paper, it is shown how skeletons can be introduced into Haskell/sub #/ at configuration level, by extending its notion of hierarchical composition of programs with process templates. The approach described is general enough to be applied to any configuration language. Its expressiveness, simplicity and elegance are demonstrated by examples, which also show its impact in Haskell/sub #/ programming practice and performance.