Skip to Main content Skip to Navigation
Conference papers

Non-Structural Subtype Entailment in Automata Theory

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

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/inria-00536514
Contributor : Joachim Niehren <>
Submitted on : Tuesday, November 16, 2010 - 1:18:54 PM
Last modification on : Tuesday, October 31, 2017 - 2:22:18 PM
Long-term archiving on: : Thursday, February 17, 2011 - 2:57:03 AM

File

pauto.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00536514, version 1

Citation

Joachim Niehren, Tim Priesnitz. Non-Structural Subtype Entailment in Automata Theory. 4th International Symposium on Theoretical Aspects of Computer Software, 2001, Sendai, Japan. pp.360--384. ⟨inria-00536514⟩

Share

Metrics

Record views

153

Files downloads

188