The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A lazy evaluator
Open accessAbstract
A different way to execute pure LISP programs is presented. It delays the evaluation of parameters and list structures without ever having to perform more evaluation steps than the usual method. Although the central idea can be found in earlier work this paper is of interest since it treats a rather well-known language and works out an algorithm which avoids full substitution. A partial correctness proof using Scott-Strachey semantics is sketched in a later section.
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
Toward a mathematical semantics for computer languages
Scott, D., & Strachey, C. (1971) · Cited by 295
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
Behavioral semantics of nonrecursive control structures
Hewitt, C. E., Bishop, P. G., Steiger, R., Greif, I., Smith, B. C., Matson, T., & Hale, R. (1974) · Lecture notes in computer science · doi:10.1007/3-540-06859-7_147 · Cited by 19
Cited by
Backus, J. (1978) · Communications of the ACM · doi:10.1145/359576.359579 · Cited by 2,609
Viewing control structures as patterns of passing messages
Hewitt, C. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90033-9 · Cited by 1,161
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
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
Purely Functional Data Structures
Okasaki, C. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511530104 · Cited by 625
Metadata
- Authors
- Henderson, P., & Morris, J. H.
- Venue
- Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76
- Publisher
- ACM Press
- Published
- 1976
- Pages
- 95-103
- OpenAlex
- W2067911767
- Cited by
- 325
- References
- 3
- FWCI
- 12.72
- Type
- conference paper
- Language
- en
- Open access
- gold
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.