The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The incremental garbage collection of processes
Open accessAbstract
This paper investigates some problems associated with an argument evaluation order that we call “future” order, which is different from both call-by-name and call-by-value, In call-by-future, each formal parameter of a function is bound to a separate process (called a “future”) dedicated to the evaluation of the corresponding argument. This mechanism allows the fully parallel evaluation of arguments to a function, and has been shown to augment the expressive power of a language.
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
Sorting networks and their applications
Batcher, K. E. (1968) · Proceedings of the April 30--May 2, 1968, spring joint computer conference on - AFIPS '68 (Spring) · doi:10.1145/1468075.1468121 · Cited by 2,417
List processing in real time on a serial computer
Baker, H. G. (1978) · Communications of the ACM · doi:10.1145/359460.359470 · Cited by 592
Self-citationHYDRA: the kernel of a multiprocessor operating system
Wulf, W., Cohen, E., Corwin, W., Jones, A., Levin, R., Pierson, C., & Pollack, F. (1974) · Communications of the ACM · doi:10.1145/355616.364017 · Cited by 488
CONS Should Not Evaluate its Arguments.
Friedman, D. P., & Wise, D. S. (1976) · International Colloquium on Automata, Languages and Programming · Cited by 267
A Multi-Level Organization for Problem Solving Using Many, Diverse, Cooperating Sources of Knowledge
Erman, L. D., & Lesser, V. R. (1975) · doi:10.21236/ada012916 · Cited by 207
Correct and optimal implementations of recursion in a simple programming language
Vuillemin, J. E. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80048-6 · Cited by 123
Synchronization in actor systems
Atkinson, R. R., & Hewitt, C. E. (1977) · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · doi:10.1145/512950.512975 · Cited by 48
Self-citation
Cited by
MULTILISP: a language for concurrent symbolic computation
Halstead, R. H. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/4472.4478 · Cited by 1,073
Swift: A language for distributed parallel scripting
Wilde, M., Hategan, M., Wozniak, J. M., Clifford, B., Katz, D. S., & Foster, I. (2011) · Parallel Computing · doi:10.1016/j.parco.2011.05.005 · Cited by 402
On the expressive power of programming languages
Felleisen, M. (1991) · Science of Computer Programming · doi:10.1016/0167-6423(91)90036-w · Cited by 297
Real-Time Machine Learning: The Missing Pieces
Nishihara, R., Moritz, P., Wang, S., Tumanov, A., Paul, W., Schleier-Smith, J., Liaw, R., Niknami, M., Jordan, M. I., & Stoica, I. (2017) · Proceedings of the 16th Workshop on Hot Topics in Operating Systems · doi:10.1145/3102980.3102998 · Cited by 49
Metadata
- Authors
- Baker, H. C., & Hewitt, C.
- Venue
- Proceedings of the 1977 symposium on Artificial intelligence and programming languages -
- Publisher
- ACM Press
- Published
- 1977
- Pages
- 55-59
- OpenAlex
- W1971181882
- Cited by
- 320
- References
- 7
- FWCI
- 3.62
- Type
- conference paper
- Language
- en
- Open access
- green
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.