A model for Java with wildcards

20Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Wildcards are a complex and subtle part of the Java type system, present since version 5.0. Although there have been various formalisations and partial type soundness results concerning wildcards, to the best of our knowledge, no system that includes all the key aspects of Java wildcards has been proven type sound. This paper establishes that Java wildcards are type sound. We describe a new formal model based on explicit existential types whose pack and unpack operations are handled implicitly, and prove it type sound. Moreover, we specify a translation from a subset of Java to our formal model, and discuss how several interesting aspects of the Java type system are handled. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Cameron, N., Drossopoulou, S., & Ernst, E. (2008). A model for Java with wildcards. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5142 LNCS, pp. 2–26). https://doi.org/10.1007/978-3-540-70592-5_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free