MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Vorobyov, Sergeidblp
Editor(s):
Gottlob, Georg
Grandjean, Etienne
Seyr, Katrin		dblp
dblp
dblp
BibTeX cite key*:
Vorobyov1998CSL
Title, Booktitle
Title*:
Subtyping Functional+Nonempty Record Types
Booktitle*:
Proceedings of the 12th International Workshop on Computer Science Logic (CSL-98), Annual Conference on the EACSL
Event, URLs
Conference URL::
http://www.dbai.tuwien.ac.at/CSL98/
Downloading URL:
Event Address*:
Brno, Czech Republic
Language:
English
Event Date*
(no longer used):
August 1998
Organization:
European Association for Computer Science Logic
Event Start Date:
22 May 2024
Event End Date:
22 May 2024
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
1584
Number:
Month:
Pages:
285-297
Year*:
1999
VG Wort Pages:
ISBN/ISSN:
3-540-65922-6
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
\begin{abstract}
\emph{Solving systems of subtype constraints} (or \emph{subtype
inequalities}) is in the core of efficient \emph{type
reconstruction} in modern object-oriented languages with subtyping
and inheritance, two problems known \emph{polynomial time
equivalent}. It is important to know how different combinations of
type constructors influence the complexity of the problem.

We show the \emph{NP-hardness} of the satisfiability problem for
subtype inequalities between object types built by using
simultaneously both the functional and the non-empty record type
constructors, but without any atomic types and atomic subtyping.

The class of constraints we address is intermediate with respect to
known classes. For pure functional types with atomic subtyping of a
special non-lattice (\emph{crown}) form solving subtype constraints
is PSPACE-complete \cite{Tiuryn92,Frey97}. On the other hand, if
there are no atomic types and subtyping on them, but the largest
$\top$ type is included, then both pure functional and pure record
(separately) subtype constraints are \emph{polynomial time solvable}
\cite{KozenPalsbergSchwartzbach94,Palsberg95ic}, which is mainly due
to the lattice type structure. We show that combining the functional
and nonempty record constructors yields NP-hardness \emph{without
any atomic subtyping}, and the same is true for just a single type
constant with a nonempty record constructor.
\end{abstract}
Keywords:
Type constraints, record, functional types, satisfiability, complexity, NP, NEXPTIME
Download
Access Level:

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
experts only
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography



BibTeX Entry:
@INPROCEEDINGS{Vorobyov1998CSL,
AUTHOR = {Vorobyov, Sergei},
 EDITOR = {Gottlob, Georg and Grandjean, Etienne and Seyr, Katrin},
 TITLE = {Subtyping Functional+Nonempty Record Types},
 BOOKTITLE = {Proceedings of the 12th International Workshop on Computer Science Logic (CSL-98), Annual Conference on the EACSL},
 PUBLISHER = {Springer},
 YEAR = {1999},
 ORGANIZATION = {European Association for Computer Science Logic},
 VOLUME = {1584},
 PAGES = {285--297},
 SERIES = {Lecture Notes in Computer Science},
 ADDRESS = {Brno, Czech Republic},
 ISBN = {3-540-65922-6},
}

Entry last modified by Uwe Brahm, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Sergei Vorobyov		Created
01/15/1999 12:28:38 PM
Revisions
6.
5.
4.
3.
2.		Editor(s)
Uwe Brahm
Anja Becker
Christine Kiesel
Uwe Brahm
Uwe Brahm		Edit Dates
10.04.2000 14:27:32
04.04.2000 10:27:28
31/03/2000 10:47:50
28.03.2000 10:43:36
27/03/2000 10:38:19