First-Order Theory of Subtyping Constraints - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

First-Order Theory of Subtyping Constraints

Résumé

We investigate the first-order theory of subtyping constraints. We show that the first-order theory of non-structural subtyping is undecidable, and we show that in the case where all constructors are either unary or nullary, the first-order theory is decidable for both structural and non-structural subtyping. The decidability results are shown by reduction to a decision problem on tree automata. This work is a step towards resolving long-standing open problems of the decidability of entailment for non-structural subtyping.
Fichier principal
Vignette du fichier
fot02.pdf (446.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : inria-00536828 , version 1

Citer

Zhendong Su, Alex Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen. First-Order Theory of Subtyping Constraints. The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002, Portland, United States. pp.203-216. ⟨inria-00536828⟩
81 Consultations
237 Téléchargements

Partager

Gmail Facebook X LinkedIn More