The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Deforestation: transforming programs to eliminate trees
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
A Transformation System for Developing Recursive Programs
Burstall, R. M., & Darlington, J. (1977) · Journal of the ACM · doi:10.1145/321992.321996 · Cited by 1,300
Principal type-schemes for functional programs
Damas, L., & Milner, R. (1982) · Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82 · doi:10.1145/582153.582176 · Cited by 1,097
The implementation of functional programming languages
(1987) · Microprocessors and Microsystems · doi:10.1016/0141-9331(87)90510-2 · Cited by 1,076
Miranda: A non-strict functional language with polymorphic types
Turner, D. A. (1985) · Lecture notes in computer science · doi:10.1007/3-540-15975-4_26 · Cited by 631
The principle type-scheme of an object in combinatory logic
Hindley, R. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0253905-6 · Cited by 448
The Principal Type-Scheme of an Object in Combinatory Logic
Hindley, R. (1969) · Transactions of the American Mathematical Society · doi:10.2307/1995158 · Cited by 319
Augustsson, L. (1985) · Lecture Notes in Computer Science · doi:10.1007/3-540-15975-4_48 · Cited by 174
Experiments with a supercompiler
Turchin, V. F., Nirenberg, R. M., & Turchin, D. (1982) · doi:10.1145/800068.802134 · Cited by 40
Cited by
MCBRIDE, C., & MCKINNA, J. (2004) · Journal of Functional Programming · doi:10.1017/s0956796803004829 · Cited by 327
Controlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88
Online partial deduction of logic programs
Prestwich, S. (1993) · Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '93 · doi:10.1145/154630.154642 · Cited by 18
Metadata
- Authors
- Wadler, P.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1990-06
- Volume
- 73
- Issue
- 2
- Pages
- 231-248
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2208923056
- Cited by
- 699
- References
- 9
- FWCI
- 12.66
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Deforestation: transforming programs to eliminate trees. https://app.cochat.ai/papers/10.1016/0304-3975(90)90147-a
- The paper
- Wadler, P. (1990). Deforestation: transforming programs to eliminate trees. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(90)90147-a
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.
