Functional Array Programming in an Extended Pi-Calculus

We study the data-parallel language BUTF, inspired by the F UTHARK language for array programming. We give a translation of BUTF into a version of the jr-calculus with broadcasting and labeled names. The translation is both complete and sound. Moreover, we propose a cost model by annotating translated BUTF processes. This is used for a complexity analysis of the translation.