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.
Type de document :
Communication dans un congrès
Évelyne Contejean. UNIF07, 2007, Paris, France. 2007
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00175937
Contributeur : Evelyne Contejean <>
Soumis le : lundi 1 octobre 2007 - 17:24:00
Dernière modification le : lundi 1 octobre 2007 - 17:33:45
Document(s) archivé(s) le : lundi 24 septembre 2012 - 13:01:00

Fichier

pluemicke.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00175937, version 1

Collections

Citation

Martin Pluemicke. Java type unification with wild cards. Évelyne Contejean. UNIF07, 2007, Paris, France. 2007. 〈inria-00175937〉

Partager

Métriques

Consultations de la notice

143

Téléchargements de fichiers

456