The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Compiling polymorphism using intensional type analysis
Open accessAbstract
The views and conclusions contained in this document are those of the authors and should not be interpreted as
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
Cites
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
Self-citationAppel, A. W. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609619 · Cited by 824
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
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
Types, Abstraction and Parametric Polymorphism.
Reynolds, J. (1983) · IFIP Congress · Cited by 754
Girard, J.-Y. (1971) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70843-7 · Cited by 592
Intensional interpretations of functionals of finite type I
Tait, W. W. (1967) · Journal of Symbolic Logic · doi:10.2307/2271658 · Cited by 557
Reflection and semantics in LISP
Smith, B. C. (1984) · Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84 · doi:10.1145/800017.800513 · Cited by 444
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
Inheritance as implicit coercion
Breazu-Tannen, V., Coquand, T., Gunter, C. A., & Scedrov, A. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90055-7 · Cited by 184
Higher-order modules and the phase distinction
Harper, R. W., Mitchell, J. C., & Moggi, E. (1990) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/96709.96744 · Cited by 167
Self-citationA simple applicative language: mini-ML
Clément, D., Despeyroux, T., Kahn, G., & Despeyroux, J. (1986) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/319838.319847 · Cited by 159
Qualified Types : Theory and Practice
Jones, M. P. (1992) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 149
A system of constructor classes: overloading and implicit higher-order polymorphism
Jones, M. P. (1993) · International Conference on Functional Programming Languages and Computer Architecture (FPCA) · doi:10.1145/165180.165190 · Cited by 124
Mitchell, J. C., & Harper, R. W. (1988) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/73560.73563 · Cited by 113
Self-citationOn the type structure of standard ML
Harper, R. W., & Mitchell, J. C. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/169701.169696 · Cited by 111
Self-citationThe semantics of reflected proof
Allen, S. F., Constable, R. L., Howe, D. J., & Aitken, W. E. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1990.113737 · Cited by 89
Polymorphic type assignment and CPS conversion
Harper, R. W., & Lillibridge, M. (1993) · LISP and Symbolic Computation · doi:10.1007/bf01019463 · Cited by 58
Self-citationA compilation method for ML-style polymorphic record calculi
Ohori, A. (1992) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/143165.143200 · Cited by 58
Cited by
CCured: type-safe retrofitting of legacy software
Necula, G. C., Condit, J., Harren, M., McPeak, S., & Weimer, W. (2005) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1065887.1065892 · Cited by 365
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
Guarded recursive datatype constructors
Xi, H., Chen, C., & Chen, G. (2003) · Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/604131.604150 · Cited by 325
TIL: a type-directed optimizing compiler for ML
Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., & Lee, P. (1996) · Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation · doi:10.1145/231379.231414 · Cited by 317
Self-citationFoundational proof-carrying code
Appel, A. W. (2002) · Proceedings 16th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2001.932501 · Cited by 308
Metadata
- Authors
- Harper, R., & Morrisett, G.
- Venue
- Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 130-141
- OpenAlex
- W2030916392
- Cited by
- 295
- References
- 19
- FWCI
- 21.16
- Type
- conference paper
- Language
- en
- Open access
- green
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.