The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Polymorphic effect systems
Abstract
We present a new approach to programming languages for parallel computers that uses an effect system to discover expression scheduling constraints. This effect system is part of a 'kinded' type system with three base kinds: types, which describe the value that an expression may return; effects, which describe the side-effects that an expression may have; and regions, which describe the area of the store in which side-effects may occur. Types, effects and regions are collectively called descriptions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Towards a theory of type structure
Reynolds, J. C. (1974) · Lecture Notes in Computer Science · doi:10.1007/3-540-06859-7_148 · Cited by 815
Report on the programming language Euclid
Lampson, B., Horning, J. J., London, R. L., Mitchell, J. G., & Popek, G. J. (1977) · ACM SIGPLAN Notices · doi:10.1145/954666.971189 · Cited by 385
Integrating functional and imperative programming
Gifford, D. K., & Lucassen, J. M. (1986) · Proceedings of the 1986 ACM conference on LISP and functional programming - LFP '86 · doi:10.1145/319838.319848 · Cited by 226
Self-citationSyntactic control of interference
Reynolds, J. C. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512766 · Cited by 200
An investigation of a programming language with a polymorphic type structure.
McCracken, N. J. (1979) · Cited by 84
(1977) · doi:10.1145/390018.808307 · Cited by 73
A COMPILER FOR THE MIT TAGGED-TOKEN DATAFLOW ARCHITECTURE
Traub, K. R. (1986) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 68
Cited by
Preliminary design of JML: a behavioral interface specification language for java
Leavens, G. T., Baker, A. L., & Ruby, C. (2006) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1127878.1127884 · Cited by 790
Region-Based Memory Management
Tofte, M., & Talpin, J.-P. (1997) · Information and Computation · doi:10.1006/inco.1996.2613 · Cited by 615
Ownership types for flexible alias protection
Clarke, D. G., Potter, J. M., & Noble, J. (1998) · Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/286936.286947 · Cited by 580
Ownership types for safe programming: preventing data races and deadlocks
Boyapati, C., Lee, R., & Rinard, M. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582440 · Cited by 570
Type-based race detection for Java
Flanagan, C., & Freund, S. N. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349328 · Cited by 446
Metadata
- Authors
- Lucassen, J. M., & Gifford, D. K.
- Venue
- Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88
- Publisher
- ACM Press
- Published
- 1988
- Pages
- 47-57
- OpenAlex
- W2046137117
- Cited by
- 481
- References
- 7
- FWCI
- 8.33
- Type
- conference paper
- 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.