We study the data-parallel language BUTF, inspired by the Futhark language for array programming. We give a translation of BUTF into a version of the pi-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.

翻译：我们研究了受Futhark数组编程语言启发的数据并行语言BUTF。我们将BUTF翻译为具有广播和标记名称的π演算变体，该翻译既完备又可靠。此外，我们通过标注翻译后的BUTF进程提出了成本模型，用于分析翻译的复杂度。