The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
LCF considered as a programming language
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
Call-by-name, call-by-value and the λ-calculus
Plotkin, G. D. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90017-1 · Cited by 1,154
Self-citation
Cited by
Games and Full Completeness for Multiplicative Linear Logic
Abramsky, S., & Jagadeesan, R. (1994) · Journal of Symbolic Logic · doi:10.2307/2275407 · Cited by 378
The origins of structural operational semantics
Plotkin, G. D. (2004) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2004.03.009 · Cited by 362
Self-citationDimensions and Principles of Declassification
Sabelfeld, A., & Sands, D. (2005) · 18th IEEE Computer Security Foundations Workshop (CSFW'05) · doi:10.1109/csfw.2005.15 · Cited by 263
No value restriction is needed for algebraic effects and handlers
KAMMAR, O., & PRETNAR, M. (2017) · Journal of Functional Programming · doi:10.1017/s0956796816000320 · Cited by 22
Metadata
- Authors
- Plotkin, G. D.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1977-12
- Volume
- 5
- Issue
- 3
- Pages
- 223-255
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2007270285
- Cited by
- 1,083
- References
- 1
- FWCI
- 6.28
- 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: LCF considered as a programming language. https://app.cochat.ai/papers/10.1016/0304-3975(77)90044-5
- The paper
- Plotkin, G. D. (1977). LCF considered as a programming language. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(77)90044-5
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.