The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Imperative functional programming
Open accessAbstract
We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is composable, extensible, efficient, requires no extensions to the type system, and extends smoothly to incorporate mixed-language working and in-place array updates.
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
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Kernighan, B. W., & Ritchie, D. M. (1978) · Cited by 1,857
Computational lambda-calculus and monads
Moggi, E. (2003) · [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science · doi:10.1109/lics.1989.39155 · Cited by 842
The essence of functional programming
Wadler, P. (1992) · Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92 · doi:10.1145/143165.143169 · Cited by 679
Self-citationWadler, P. (1990) · Proceedings of the 1990 ACM conference on LISP and functional programming · doi:10.1145/91556.91592 · Cited by 576
Self-citationComputational interpretations of linear logic
Abramsky, S. (1993) · Theoretical Computer Science · doi:10.1016/0304-3975(93)90181-r · Cited by 409
(1990) · Cited by 392
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
Type inference for polymorphic references
Tofte, M. (1990) · Information and Computation · doi:10.1016/0890-5401(90)90018-d · Cited by 185
Algebraic reconstruction of types and effects
Jouvelot, P., & Gifford, D. K. (1991) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/99583.99623 · Cited by 145
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
Single-threaded polymorphic lambda calculus
Guzmán, J. C., & Hudak, P. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1990.113759 · Cited by 90
Assignments for applicative languages
Swarup, V., Reddy, U. S., & Ireland, E. (1991) · Lecture notes in computer science · doi:10.1007/3540543961_10 · Cited by 57
Update analysis and the efficient implementation of functional aggregates
Bloss, A. (1989) · International Conference on Functional Programming Languages and Computer Architecture (FPCA) · doi:10.1145/99370.99373 · Cited by 53
Wakeling, D., & Runciman, C. (1991) · Lecture notes in computer science · doi:10.1007/3540543961_11 · Cited by 25
Cited by
Constraint logic programming: a survey
Jaffar, J., & Maher, M. J. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90033-7 · Cited by 1,312
Biere, A., Cimatti, A., Clarke, E. M., Strichman, O., & Zhu, Y. (2003) · Advances in Computers · doi:10.1016/s0065-2458(03)58003-2 · Cited by 952
A survey of shape analysis techniques
Loncaric, S. (1998) · Pattern Recognition · doi:10.1016/s0031-2023(97)00122-2 · Cited by 950
Region-Based Memory Management
Tofte, M., & Talpin, J.-P. (1997) · Information and Computation · doi:10.1006/inco.1996.2613 · Cited by 615
Monad transformers and modular interpreters
Liang, S., Hudak, P., & Jones, M. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199528 · Cited by 503
Metadata
- Authors
- Peyton Jones, S. L., & Wadler, P.
- Venue
- Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93
- Publisher
- ACM Press
- Published
- 1993
- Pages
- 71-84
- OpenAlex
- W2078944436
- Cited by
- 1,234
- References
- 15
- FWCI
- 61.19
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.