Functional Array Programming in an Extended Pi-Calculus
Hans H\"uttel (Department of Computer Science, University of, Copenhagen), Lars Jensen (Department of Computer Science, Aalborg, University), Chris Oliver Paulsen (Department of Computer Science, Aalborg, University), Julian Teule (Department of Computer Science, Aalborg
TL;DR
This paper introduces a translation of the data-parallel language BUTF, inspired by Futhark, into an extended pi-calculus with broadcasting, enabling complexity analysis through a novel cost model.
Contribution
It provides a complete and sound translation of BUTF into an extended pi-calculus and proposes a cost model for complexity analysis.
Findings
Translation is both complete and sound.
Cost model enables complexity analysis.
Framework bridges array programming and process calculus.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.