The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Lambda lifting: Transforming programs to recursive equations
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
A new implementation technique for applicative languages
Turner, D. A. (1979) · Software: Practice and Experience · doi:10.1002/spe.4380090105 · Cited by 610
The next 700 programming languages
Landin, P. J. (1966) · Communications of the ACM · doi:10.1145/365230.365257 · Cited by 578
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
Self-citationAugustsson, L. (1985) · Lecture Notes in Computer Science · doi:10.1007/3-540-15975-4_48 · Cited by 174
Design and Analysis of Algorithms
Sen, S., & Kumar, A. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108654937 · Cited by 28
Cited by
Executing a program on the MIT tagged-token dataflow architecture
Arvind, & Nikhil, R. S. (1990) · IEEE Transactions on Computers · doi:10.1109/12.48862 · Cited by 401
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
Views: a way for pattern matching to cohabit with data abstraction
Wadler, P. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41653 · Cited by 321
York, B. N., Loeb, S., & Doss, C. (2019) · Journal of Human Resources · doi:10.3368/jhr.54.3.0517-8756r · Cited by 223
Using parameterized signatures to express modular structure
Jones, M. P. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237731 · Cited by 57
Metadata
- Authors
- Johnsson, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1985
- Pages
- 190-203
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2118172707
- Cited by
- 362
- References
- 5
- FWCI
- 6.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Lambda lifting: Transforming programs to recursive equations. https://app.cochat.ai/papers/10.1007/3-540-15975-4_37
- The paper
- Johnsson, T. (1985). Lambda lifting: Transforming programs to recursive equations. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-15975-4_37
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.