The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Local type inference
Open accessAbstract
We study two partial type inference methods for a language combining subtyping and impredicative polymorphism. Both methods are local in the sense that missing annotations are recovered using only information from adjacent nodes in the syntax tree, without long-distance constraints such as unification variables. One method infers type arguments in polymorphic applications using a local constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate our design choices by a statistical analysis of the uses of type inference in a sizable body of existing ML code.
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
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
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
A unification algorithm for typed λ-calculus
Huet, G. P. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90011-0 · Cited by 510
Type inclusion constraints and type inference
Aiken, A., & Wimmers, E. L. (1993) · Proceedings of the conference on Functional programming languages and computer architecture · doi:10.1145/165180.165188 · Cited by 262
Type inference with constrained types
Odersky, M., Sulzmann, M., & Wehr, M. (1999) · Theory and Practice of Object Systems · doi:10.1002/(sici)1096-9942(199901/03)5:1<35::aid-tapo4>3.0.co;2-4 · Cited by 216
Complete Type Inference for Simple Objects
Wand, M. (1987) · Logic in Computer Science · Cited by 215
Unification under a mixed prefix
Miller, D. (1992) · Journal of Symbolic Computation · doi:10.1016/0747-7171(92)90011-r · Cited by 166
Putting type annotations to work
Odersky, M., & Läufer, K. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237729 · Cited by 165
Elf: a language for logic definition and verified metaprogramming
Pfenning, F. (2003) · doi:10.1109/lics.1989.39186 · Cited by 115
Typability and type checking in the second-order λ-calculus are equivalent and undecidable
Wells, J. B. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1994.316068 · Cited by 108
Cited by
Large Language Models for Software Engineering: A Systematic Literature Review
Hou, X., Zhao, Y., Liu, Y., Yang, Z., Wang, K., Li, L., Luo, X., Lo, D., Grundy, J., & Wang, H. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3695988 · Cited by 1,029
CONVENT, L., LINDLEY, S., MCBRIDE, C., & MCLAUGHLIN, C. (2020) · Journal of Functional Programming · doi:10.1017/s0956796820000039 · Cited by 39
Metadata
- Authors
- Pierce, B. C., & Turner, D. N.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 2000-01
- Volume
- 22
- Issue
- 1
- Pages
- 1-44
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2036676170
- Cited by
- 287
- References
- 21
- FWCI
- 3.33
- 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: Local type inference. https://app.cochat.ai/papers/10.1145/345099.345100
- The paper
- Pierce, B. C., & Turner, D. N. (2000). Local type inference. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/345099.345100
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.