The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
The typechecking of programs with implicit type structure
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“We maintain scopes using rank-2 polymorphism [Jones 1996;McCracken 1984], a well-understood technique found in work on monadic encapsulation [Peyton Jones and Launchbury 1995;Timany et al. 2017].”
From First-class names for effect handlers (2022) · cites this paper as McCracken 1984
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
To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism
Curry, H. B., Hindley, J. R., & Seldin, J. P. (1980) · Academic Press eBooks · Cited by 924
Towards a theory of type structure
Reynolds, J. C. (1974) · Lecture Notes in Computer Science · doi:10.1007/3-540-06859-7_148 · Cited by 815
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
Functional Characters of Solvable Terms
Coppo, M., Mariangiola Dezani-ciancaglini, A., & Betti Venneri, B. (1981) · Mathematical logic quarterly · doi:10.1002/malq.19810270205 · Cited by 195
Leivant, D. M. (1983) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/567067.567077 · Cited by 182
An investigation of a programming language with a polymorphic type structure.
McCracken, N. J. (1979) · Cited by 84
Self-citationPrincipal type-schemes and lambda-calculus semantics
Coppo, M., Dezani, M., & Betti Venneri, B. (1980) · Institutional Research Information System University of Turin (University of Turin) · Cited by 52
Cited by
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
A semantics of multiple inheritance
Cardelli, L. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90007-7 · Cited by 624
Abstract types have existential type
Mitchell, J. C., & Plotkin, G. D. (1988) · ACM Transactions on Programming Languages and Systems · doi:10.1145/44501.45065 · Cited by 429
A semantics of multiple inheritance
Cardelli, L. (1984) · Lecture notes in computer science · doi:10.1007/3-540-13346-1_2 · Cited by 359
Launchbury, J., & Jones, S. (1994) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/178243.178246 · Cited by 203
Metadata
- Authors
- McCracken, N.
- Affiliations
- Syracuse University (US)
- Corresponding author
- McCracken, Nancy
- ORCID
- McCracken, Nancy
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1984
- Pages
- 301-315
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2125360711
- Cited by
- 53
- References
- 8
- Citations by year
- 2024: 1 · 2020: 1 · 2016: 1
- FWCI
- 2.69
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
- Social Sciences › Arts and Humanities › Language and Linguistics › Syntax, Semantics, Linguistic Variation
- Keywords
- type checking, type inference, program semantics, type systems
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: The typechecking of programs with implicit type structure. https://app.cochat.ai/papers/10.1007/3-540-13346-1_15
- The paper
- McCracken, N. (1984). The typechecking of programs with implicit type structure. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-13346-1_15
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.
