|
|
|
|
| LEADER |
01602 am a22002533u 4500 |
| 001 |
109518 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Chen, Jiahao
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Mathematics
|e contributor
|
| 100 |
1 |
0 |
|a Chen, Jiahao
|e contributor
|
| 100 |
1 |
0 |
|a Edelman, Alan
|e contributor
|
| 700 |
1 |
0 |
|a Edelman, Alan
|e author
|
| 245 |
0 |
0 |
|a Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof
|
| 260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2017-06-01T20:21:12Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/109518
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a Intel Science and Technology Center for Big Data
|
| 520 |
|
|
|a Massachusetts Institute of Technology. Deshpande Center (Innovation Grant)
|
| 520 |
|
|
|a United States. Defense Advanced Research Projects Agency. XDATA Program
|
| 520 |
|
|
|a National Science Foundation (U.S.) (Grant DMS- 1312831)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t 2014 First Workshop for High Performance Technical Computing in Dynamic Languages
|
