Please use this identifier to cite or link to this item: doi:10.22028/D291-25769
Title: First-order theory of subtyping constraints
Author(s): Su, Zhendong
Aiken, Alexander
Niehren, Joachim
Priesnitz, Tim
Treinen, Ralf
Language: English
Year of Publication: 2002
OPUS Source: The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, 16-18 January 2002, pp.203-216
SWD key words: Entscheidbarkeit ; Untertyp
Free key words: Subtyping Constraints
DDC notations: 004 Computer science, internet
Publikation type: Conference Paper
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.
Link to this record: urn:nbn:de:bsz:291-scidok-2843
Date of registration: 5-Jul-2004
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fot02.pdf446,72 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.