The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Subtyping recursive types
Open accessAbstract
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive)types are in the subtype relation and whether a term has a type. To address the first question, we relate various definitions of type equivalence and subtyping that are induced by a model, an ordering on infinite trees, an algorithm, and a set of type rules. We show soundness and completeness among the rules, the algorithm, and the tree semantics. We also prove soundness and a restricted form of completeness for the model. To address the second question, we show that to every pair of types in the subtype relation we can associate a term whose denotation is the uniquely determined coercion map between the two types. Moreover, we derive an algorithm that, when given a term with implicit coercions, can infer its least type whenever possible.
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
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
Self-citationScott, D. (2006) · Springer eBooks · doi:10.1007/bfb0079432 · Cited by 737
A semantics of multiple inheritance
Cardelli, L. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90007-7 · Cited by 624
Self-citationInheritance 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
Bormann, J. (1970) · ZAMM ‐ Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik · doi:10.1002/zamm.19700501120 · Cited by 87
Cited by
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
Necula, G. C., McPeak, S., Rahul, S. P., & Weimer, W. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_16 · Cited by 977
A theory of platform-dependent low-level software
Nita, M., Grossman, D., & Chambers, C. (2008) · Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1328438.1328465 · Cited by 16
Metadata
- Authors
- Amadio, R. M., & Cardelli, L.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1993-09
- Volume
- 15
- Issue
- 4
- Pages
- 575-631
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2123727486
- Cited by
- 350
- References
- 5
- FWCI
- 17.28
- 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
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.