Java type unification with wild cards - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Java type unification with wild cards


With the introduction of Java 5.0 the type system has been extended by parameterized types, type variables, type terms, and wildcards. As a result very complex types can arise. The term Vector is for example a correct type in Java 5.0. In this paper we present a type unification algorithm for Java 5.0 type terms. The algorithm unifies type terms, which are in subtype relationship. For this we define Java 5.0 type terms and its subtyping relation, formally. As Java 5.0 allows wildcards as instances of generic types, the subtyping ordering contains infinite chains. We show that the type unification is still finitary. We give a type unification algorithm, which calculates the finite set of general unifiers.
Fichier principal
Vignette du fichier
pluemicke.pdf (185.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00175937 , version 1 (01-10-2007)


  • HAL Id : inria-00175937 , version 1


Martin Pluemicke. Java type unification with wild cards. UNIF07, 2007, Paris, France. ⟨inria-00175937⟩


65 View
421 Download


Gmail Facebook Twitter LinkedIn More