The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Putting type annotations to work
Open accessAbstract
We study an extension of the Hindley/Milner system with explicit type scheme annotations and type declarations. The system can express polymorphic function arguments, user-defined data types with abstract components, and structure types with polymorphic fields. More generally, all programs of the polymorphic lambda calculus can be encoded by a translation between typing derivations. We show that type reconstruction in this system can be reduced to the decidable problem of first-order unification under a mixed prefix.
Overview
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
The typechecking of programs with implicit type structure
McCracken, N. (1984) · Lecture Notes in Computer Science · doi:10.1007/3-540-13346-1_15 · Cited by 53
Cited by
Scrap your boilerplate: a practical design pattern for generic programming
Lämmel, R., & Jones, S. P. (2003) · Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation · doi:10.1145/604174.604179 · Cited by 351
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
Metadata
- Authors
- Odersky, M., & Läufer, K.
- Venue
- Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 54-67
- OpenAlex
- W1985088747
- Cited by
- 165
- References
- 1
- FWCI
- 8.58
- Type
- conference paper
- 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: Putting type annotations to work. https://app.cochat.ai/papers/10.1145/237721.237729
- The paper
- Odersky, M., & Läufer, K. (1996). Putting type annotations to work. Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96. https://doi.org/10.1145/237721.237729
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.