The DOI matches its Crossref record.
The Principal Type-Scheme of an Object in Combinatory Logic
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
Cited by
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
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
How to make ad-hoc polymorphism less ad hoc
Wadler, P., & Blott, S. (1989) · Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 · doi:10.1145/75277.75283 · Cited by 773
Deforestation: transforming programs to eliminate trees
Wadler, P. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90147-a · Cited by 699
Honda, K. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57208-2_35 · Cited by 396
A large scale study of programming languages and code quality in github
Ray, B., Posnett, D., Filkov, V., & Devanbu, P. (2014) · Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering · doi:10.1145/2635868.2635922 · Cited by 389
Essentials of programming languages
(2008) · Choice Reviews Online · doi:10.5860/choice.46-1527 · Cited by 316
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
CARETTE, J., KISELYOV, O., & SHAN, C.-C. (2009) · Journal of Functional Programming · doi:10.1017/s0956796809007205 · Cited by 279
Koka: Programming with Row Polymorphic Effect Types
Leijen, D. (2014) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.153.8 · Cited by 111
HMF: simple type inference for first-class polymorphism
Leijen, D. (2008) · Proceedings of the 13th ACM SIGPLAN international conference on Functional programming · doi:10.1145/1411204.1411245 · Cited by 44
First class dynamic effect handlers: or, polymorphic heaps with dynamic effect handlers
Leijen, D. (2018) · Proceedings of the 3rd ACM SIGPLAN International Workshop on Type-Driven Development · doi:10.1145/3240719.3241789 · Cited by 3
Metadata
- Authors
- Hindley, R.
- Venue
- Transactions of the American Mathematical Society
- Publisher
- JSTOR
- Published
- 1969-12
- Volume
- 146
- Pages
- 29
- ISSN
- 0002-9947 (ISSN-L)
- OpenAlex
- W4249075482
- Cited by
- 319
- References
- 0
- FWCI
- 0.72
- Type
- journal article
- 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
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.