HackerPapers

arXiv:1410.6449cs.PL

Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof

Jiahao Chen, Alan Edelman

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Polymorphism in programming languages enables code reuse. Here, we show that polymorphism has broad applicability far beyond computations for technical computing: parallelism in distributed computing, presentation of visualizations of runtime data flow, and proofs for formal verification of correctness. The ability to reuse a single codebase for all these purposes provides new ways to understand and verify parallel programs.

arXiv comments
10 pages, 3 figures. Proceedings of HPTCDL, the 1st Workshop on High Performance Technical Computing in Dynamic Languages, November 17, 2014, New Orleans, Louisiana, USA. Supporting Information available at http://jiahao.github.io/parallel-prefix
Journal reference
DOI
Subjects
cs.PLProgramming Languages

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Oct 2014 to Oct 2014. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.