Skip to Main content Skip to Navigation
Conference papers

First-Order Theory of Subtyping Constraints

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

Cited literature [42 references]  Display  Hide  Download
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 11:13:03 PM
Last modification on : Sunday, June 26, 2022 - 11:52:36 AM
Long-term archiving on: : Thursday, February 17, 2011 - 3:18:24 AM


Files produced by the author(s)


  • HAL Id : inria-00536828, version 1



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⟩



Record views


Files downloads