Proceedings of the 23rd ACM SIGPLAN Conference on Object-Oriented Programming Systems Languages and Applications 2008
DOI: 10.1145/1449764.1449804
|View full text |Cite
|
Sign up to set email alerts
|

Java type inference is broken

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(24 citation statements)
references
References 5 publications
0
23
0
Order By: Relevance
“…For example, the work in [8,7,10,16,47] was mostly focused on researching OO generics, while the work in [18,20,19,21] was focused on type safety. Some research on generics, and generic type inference, was also done after generics were added to Java, e.g., [40,50,4,26].…”
Section: Related Workmentioning
confidence: 99%
“…For example, the work in [8,7,10,16,47] was mostly focused on researching OO generics, while the work in [18,20,19,21] was focused on type safety. Some research on generics, and generic type inference, was also done after generics were added to Java, e.g., [40,50,4,26].…”
Section: Related Workmentioning
confidence: 99%
“…The same flexibility also proved challenging to both researchers and practitioners. The soundness of wildcards in Java has only recently been proven [4], and the implementation of wildcards has been mired in issues [5,15,16].…”
Section: Related Workmentioning
confidence: 99%
“…The constraint false is never satisfied, and the constraint true is always satisfied. The equivalence constraint S ≡ T is derived as S <: T ∧ T <: S. Following Smith and Cartwright [16], we normalize all constraint formulas into disjunctive normal form and simplify away obvious contradictions and redundancies. We further make use of some auxiliary meta-level definitions, defined in Figure 4.…”
Section: Constraint Formsmentioning
confidence: 99%