The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
On the expressive power of programming languages
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
Introduction to Metamathematics
Rasiowa, H. (1952) · Medical Entomology and Zoology · Cited by 4,307
The Lambda Calculus - Its Syntax and Semantics
(1984) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/c2009-0-14341-6 · Cited by 2,787
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
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
Burris, S., & Sankappanavar, H. P. (1981) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-8130-3 · Cited by 2,027
A Course in Universal Algebra.
Blass, A. R., Burris, S. N., & Sankappanavar, H. P. (1984) · American Mathematical Monthly · doi:10.1080/00029890.1984.11971342 · Cited by 1,936
A formulation of the simple theory of types
Church, A. (1940) · Journal of Symbolic Logic · doi:10.2307/2266170 · Cited by 1,903
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
LCF considered as a programming language
Plotkin, G. D. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90044-5 · Cited by 1,083
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
Cited by
A Survey and Classification of Controlled Natural Languages
Kuhn, T. (2014) · Computational Linguistics · doi:10.1162/coli_a_00168 · Cited by 350
DrScheme: a programming environment for Scheme
FINDLER, R. B., CLEMENTS, J., FLANAGAN, C., FLATT, M., KRISHNAMURTHI, S., STECKLER, P., & FELLEISEN, M. (2002) · Journal of Functional Programming · doi:10.1017/s0956796801004208 · Cited by 341
Self-citationNo 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
- Felleisen, M.
- Venue
- Science of Computer Programming
- Publisher
- Elsevier BV
- Published
- 1991-12
- Volume
- 17
- Issue
- 1-3
- Pages
- 35-75
- ISSN
- 0167-6423 (ISSN-L)
- OpenAlex
- W2102222848
- Cited by
- 297
- References
- 23
- FWCI
- 7.95
- 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: On the expressive power of programming languages. https://app.cochat.ai/papers/10.1016/0167-6423(91)90036-w
- The paper
- Felleisen, M. (1991). On the expressive power of programming languages. Science of Computer Programming. https://doi.org/10.1016/0167-6423(91)90036-w
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.