We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms in so-called direct mode. In a directmode BSP algorithm, the physical structure of processes is made explicit. The execution time can then be estimated and dead-locks and indeterminism are avoided. This paper outlines an extension of BSML and of the BSλ-calculus (a calculus of functional bulk synchronous parallel programs) with pattern matching of parallel values. 1