The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A natural semantics for lazy evaluation
Abstract
We define an operational semantics for lazy evaluation which provides an accurate model for sharing. The only computational structure we introduce is a set of bindings which corresponds closely to a heap. The semantics is set at a considerably higher level of abstraction than operational semantics for particular abstract machines, so is more suitable for a variety of proofs. Furthermore, because a heap is explicitly modelled, the semantics provides a suitable framework for studies about space behaviour of terms under lazy evaluation.
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
I-structures: data structures for parallel computing
Arvind, Nikhil, R. S., & Pingali, K. K. (1989) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69558.69562 · Cited by 360
Abramsky, S. (1990) · Cited by 325
Efficient compilation of lazy evaluation
Johnsson, T. (1984) · Proceedings of the 1984 SIGPLAN symposium on Compiler construction - SIGPLAN '84 · doi:10.1145/502874.502880 · Cited by 225
Tim: A simple, lazy abstract machine to execute supercombinators
Fairbairn, J., & Wray, S. (1987) · Lecture notes in computer science · doi:10.1007/3-540-18317-5_3 · Cited by 144
Cited by
Purely Functional Data Structures
Okasaki, C. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511530104 · Cited by 625
Linear Haskell: practical linearity in a higher-order polymorphic language
Bernardy, J.-P., Boespflug, M., Newton, R. R., Peyton Jones, S., & Spiwack, A. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158093 · Cited by 97
LazyDAgger: Reducing Context Switching in Interactive Imitation Learning
Hoque, R., Balakrishna, A., Putterman, C., Luo, M., Brown, D. S., Seita, D., Thananjeyan, B., Novoseller, E., & Goldberg, K. (2021) · 2021 IEEE 17th International Conference on Automation Science and Engineering (CASE) · doi:10.1109/case49439.2021.9551469 · Cited by 31
“The name LazyDAgger is inspired by the concept of lazy evaluation in programming language theory [29], where”
Method
Metadata
- Authors
- Launchbury, J.
- Venue
- Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93
- Publisher
- ACM Press
- Published
- 1993
- Pages
- 144-154
- OpenAlex
- W2004843654
- Cited by
- 371
- References
- 4
- FWCI
- 11.83
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A natural semantics for lazy evaluation. https://app.cochat.ai/papers/10.1145/158511.158618
- The paper
- Launchbury, J. (1993). A natural semantics for lazy evaluation. Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93. https://doi.org/10.1145/158511.158618
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.