The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Manifest types, modules, and separate compilation
Open accessAbstract
International audience
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
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
Principal type-schemes for functional programs
Damas, L., & Milner, R. (1982) · Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82 · doi:10.1145/582153.582176 · Cited by 1,097
Wirth, N. (1988) · Springer eBooks · doi:10.1007/978-3-642-83565-0 · Cited by 896
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 type-theoretic approach to higher-order modules with sharing
Harper, R., & Lillibridge, M. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.176927 · Cited by 287
MacQueen, D. (1984) · Proceedings of the 1984 ACM Symposium on LISP and functional programming - LFP '84 · doi:10.1145/800055.802036 · Cited by 269
Cardelli, L., & Mitchell, J. C. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0018345 · Cited by 203
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
Using dependent types to express modular structure
MacQueen, D. B. (1986) · Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86 · doi:10.1145/512644.512670 · Cited by 159
On 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
Shao, Z., & Appel, A. W. (1993) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/158511.158702 · Cited by 70
Abstract types and the dot notation
Cardelli, L., & Leroy, X. (1990) · HAL · Cited by 60
Self-citationPrincipal signatures for higher-order program modules
Tofte, M. (1992) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/143165.143206 · Cited by 29
Extending record typing to type parametric modules with sharing
Aponte, M.-V. (1993) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/158511.158704 · Cited by 12
Cited by
Advanced Topics in Types and Programming Languages
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/1104.001.0001 · Cited by 348
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
Essentials of programming languages
(2008) · Choice Reviews Online · doi:10.5860/choice.46-1527 · Cited by 316
A type-theoretic approach to higher-order modules with sharing
Harper, R., & Lillibridge, M. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.176927 · Cited by 287
Using parameterized signatures to express modular structure
Jones, M. P. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237731 · Cited by 57
Metadata
- Authors
- Leroy, X.
- Venue
- Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94
- Publisher
- ACM Press
- Published
- 1994
- Pages
- 109-122
- OpenAlex
- W2145945984
- Cited by
- 257
- References
- 15
- FWCI
- 15.40
- 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.