The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A call-by-need lambda calculus
Abstract
The mismatch between the operational semantics of the lambda calculus and the actual behavior of implementations is a major obstacle for compiler writers. They cannot explain the behavior of their evaluator in terms of source level syntax, and they cannot easily compare distinct implementations of different lazy strategies. In this paper we derive an equational characterization of call-by-need and prove it correct with respect to the original lambda calculus. The theory is a strictly smaller theory than the lambda calculus. Immediate applications of the theory concern the correctness proofs of a number of implementation strategies, e.g., the call-by-need continuation passing transformation and the realization of sharing via assignments.
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
Cited by
Purely Functional Data Structures
Okasaki, C. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511530104 · Cited by 625
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
CARETTE, J., KISELYOV, O., & SHAN, C.-C. (2009) · Journal of Functional Programming · doi:10.1017/s0956796809007205 · Cited by 279
Semmelroth, M., & Sabry, A. (1999) · Proceedings of the fourth ACM SIGPLAN international conference on Functional programming · doi:10.1145/317636.317777 · Cited by 28
Metadata
- Authors
- Ariola, Z. M., Maraist, J., Odersky, M., Felleisen, M., & Wadler, P.
- Venue
- Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 233-246
- OpenAlex
- W2030663607
- Cited by
- 246
- References
- 1
- FWCI
- 23.39
- 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.