Non-Structural Subtype Entailment in Automata Theory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2003

Non-Structural Subtype Entailment in Automata Theory


Decidability of non-structural subtype entailment is a long-standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize the problem equivalently by using regular expressions and word equations. This characterization induces new results on non-structural subtype entailment, constitutes a promising starting point for further investigations on decidability, and explains for the first time why the problem is so difficult. The difficulty is caused by implicit word equations that we make explicit.
Fichier principal
Vignette du fichier
SubTypeEntailment_02.pdf (612.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00536540 , version 1 (05-02-2011)


  • HAL Id : inria-00536540 , version 1


Joachim Niehren, Tim Priesnitz. Non-Structural Subtype Entailment in Automata Theory. Information and Computation, 2003, 169 (2), pp.319-354. ⟨inria-00536540⟩
168 View
113 Download


Gmail Facebook X LinkedIn More