HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Java type unification with wild cards

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

Contributor : Evelyne Contejean Connect in order to contact the contributor
Submitted on : Monday, October 1, 2007 - 5:24:00 PM
Last modification on : Monday, October 1, 2007 - 5:33:45 PM
Long-term archiving on: : Monday, September 24, 2012 - 1:01:00 PM


Files produced by the author(s)


  • HAL Id : inria-00175937, version 1



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



Record views


Files downloads