Entailment of Non-Structural Subtype Constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

Entailment of Non-Structural Subtype Constraints

Résumé

Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to be surprisingly difficult. The situation was clarified by Rehof and Henglein who proved entailment of structural subtype constraints to be coNP-complete for simple types and PSPACE-complete for recursive types. For entailment of non-structural subtype constraints of both simple and recursive types they proved PSPACE-hardness and conjectured PSPACE-completeness but failed in finding a complete algorithm. In this paper, we investigate the source of complications and isolate a natural subproblem of non-structural subtype entailment that we prove PSPACE-complete. We conjecture (but this is left open) that the presented approach can be extended to the general case.
Fichier principal
Vignette du fichier
SubTypeEntailment_99.pdf (178.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00536825 , version 1 (16-11-2010)

Identifiants

  • HAL Id : inria-00536825 , version 1

Citer

Joachim Niehren, Tim Priesnitz. Entailment of Non-Structural Subtype Constraints. Asian Computing Science Conference, 1999, Phuket, Thailand. pp.251--265. ⟨inria-00536825⟩
62 Consultations
169 Téléchargements

Partager

Gmail Facebook X LinkedIn More