Publication details

Programming Systems

Gert Smolka

Publications

Teaching

Software

Formalizations

First-Order Theory of Subtyping Constraints

Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen

The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, The ACM Press, January 2002

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.

Download PDF        Show BibTeX               

@INPROCEEDINGS{fot:02,
  title = {First-Order Theory of Subtyping Constraints},
  author = {Zhendong Su and Alexander Aiken and Joachim Niehren and Tim Priesnitz and Ralf Treinen},
  year = {2002},
  month = {jan#{ 16-18}},
  publisher = {{{The ACM Press}}},
  booktitle = {The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages},
  address = {{Portland, USA}},
}

Login to edit