Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof
classification
💻 cs.PL
keywords
polymorphismcomputingparallelpresentationreuseabilityapplicabilitybeyond
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.