The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
I-structures: data structures for parallel computing
Abstract
It is difficult to achieve elegance, efficiency, and parallelism simultaneously in functional programs that manipulate large data structures. We demonstrate this through careful analysis of program examples using three common functional data-structuring approaches-lists using Cons, arrays using Update (both fine-grained operators), and arrays using make-array (a “bulk” operator). We then present I-structure as an alternative and show elegant, efficient, and parallel solutions for the program examples in Id, a language with I-structures. The parallelism in Id is made precise by means of an operational semantics for Id as a parallel reduction system. I-structures make the language nonfunctional, but do not lose determinacy. Finally, we show that even in the context of purely functional languages, I-structures are invaluable for implementing functional data abstractions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
The implementation of functional programming languages
(1987) · Microprocessors and Microsystems · doi:10.1016/0141-9331(87)90510-2 · Cited by 1,076
Jones, S. (1987) · Cited by 812
Advanced compiler optimizations for supercomputers
Padua, D. A., & Wolfe, M. J. (1986) · Communications of the ACM · doi:10.1145/7902.7904 · Cited by 690
Dependence graphs and compiler optimizations
Kuck, D. J., Kuhn, R. H., Padua, D. A., Leasure, B., & Wolfe, M. (1981) · Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81 · doi:10.1145/567532.567555 · Cited by 651
Tupac, J. D. (1963) · Spartan Books · Cited by 530
Lambda lifting: Transforming programs to recursive equations
Johnsson, T. (1985) · Lecture Notes in Computer Science · doi:10.1007/3-540-15975-4_37 · Cited by 362
Arvind, & Culler, D. E. (1986) · Annual Review of Computer Science · doi:10.1146/annurev.cs.01.060186.001301 · Cited by 259
Self-citationPFC: A Program to Convert Fortran to Parallel Form
Allen, J. R., & Kennedy, K. (1982) · Rice Research Repository (Rice University) · Cited by 194
A semantic model of reference counting and its abstraction (detailed summary)
Hudak, P. (1986) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/319838.319876 · Cited by 141
At Massachusetts Institute of Technology
Greeley, R. B. (1945) · The Journal of Land & Public Utility Economics · doi:10.2307/3159000 · Cited by 107
A COMPILER FOR THE MIT TAGGED-TOKEN DATAFLOW ARCHITECTURE
Traub, K. R. (1986) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 68
RESOURCE MANAGEMENT FOR THE TAGGED TOKEN DATAFLOW ARCHITECTURE
Culler, D. (1985) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 22
A fully abstract semantics for a functional language with logic variables
Jagadeesan, R., Panangaden, P., & Pingali, K. K. (2003) · doi:10.1109/lics.1989.39184 · Cited by 22
Self-citationProceedings of the 1986 ACM conference on LISP and functional programming
Scherlis, W. L., Association for Computing Machinery-Digital Library, ACM Special Interest Group on Programming Languages, et al. (1986) · Cited by 21
Cited by
Scheduling multithreaded computations by work stealing
Blumofe, R. D., & Leiserson, C. E. (1999) · Journal of the ACM · doi:10.1145/324133.324234 · Cited by 1,336
Advances in dataflow programming languages
Johnston, W. M., Hanna, J. R. P., & Millar, R. J. (2004) · ACM Computing Surveys · doi:10.1145/1013208.1013209 · Cited by 503
A natural semantics for lazy evaluation
Launchbury, J. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158618 · Cited by 371
A monad for deterministic parallelism
Marlow, S., Newton, R., & Peyton Jones, S. (2011) · Proceedings of the 4th ACM symposium on Haskell · doi:10.1145/2034675.2034685 · Cited by 98
Kuper, L., Turon, A., Krishnaswami, N. R., & Newton, R. R. (2014) · Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2535838.2535842 · Cited by 46
Metadata
- Authors
- Arvind, Nikhil, R. S., & Pingali, K. K.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1989-10
- Volume
- 11
- Issue
- 4
- Pages
- 598-632
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W1986804682
- Cited by
- 360
- References
- 15
- FWCI
- 18.31
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.