Fritz Henglein, Jakob Rehof  Home/Search
Context Related
| microsoft.com/~rehof/lics97.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: microsoft.com/~reh...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0 , if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0 . We study the complexity of subtype entailment for simple types over lattices of base types. We show that: ffl deciding C j= 0 is coNP-complete. ffl deciding C j= ff fi for consistent, atomic C and ff; fi atomic can be done in linear time. The structural lower (coNP-hardness) and upper... (Update)
Context of citations to this paper: More
...is decidable; however, this study does not yield a practical algorithm for solving constraints. On the other hand, previous works [HR97, Sim03c] described e#cient algorithms for deciding top level entailment of constraints, where all free variables are implicitly universally...
Cited by: More
Structural Subtyping of Non-Recursive Types is Decidable - Kuncak, Rinard (2003) (Correct)
Subtype Constraints in Modal Logic - Niehren, Priesnitz (2005) (Correct)
Modular and Constraint-based Information Flow Inference.. - Sun, Banerjee, Naumann (2004) (Correct)
Active bibliography (related documents): More All
0.8: Minimal Typings in Atomic Subtyping - Rehof (1996) (Correct)
0.5: The Complexity of Simple Subtyping Systems - Rehof (1998) (Correct)
0.5: Satisfying Subtype Inequalities in Polynomial Space - Frey (1997) (Correct)
Similar documents based on text: More All
1.0: Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999) (Correct)
0.7: Principal Typings Demystified: what they are, why you want them.. - Wells (Correct)
0.5: Non-Structural Subtype Entailment in Automata Theory - Niehren, Priesnitz (2001) (Correct)
Related documents from co-citation: More All
12: Constraint automata and the complexity of recursive subtype entailment - Henglein, Rehof - 1998
12: Simplifying subtyping constraints - Pottier - 1996
11: Type inference with simple subtypes (context) - Mitchell - 1991
BibTeX entry: (Update)
Fritz Henglein and Jakob Rehof. The Complexity of Subtype Entailment for Simple Types. In Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 352-361, Warsaw, Poland, July 1997. http://citeseer.ist.psu.edu/henglein97complexity.html More
@inproceedings{ henglein97complexity,
author = "Fritz Henglein and Jakob Rehof",
title = "The Complexity of Subtype Entailment for Simple Types",
booktitle = "Logic in Computer Science",
pages = "352-361",
year = "1997",
url = "citeseer.ist.psu.edu/henglein97complexity.html" }
Citations (may not include all citations):4212 Computers and Intractability -- A Guide to the Theory of NP-.. (context) - Garey, Johnson - 1979
88 A type system equivalent to flow analysis - Palsberg, O'Keefe - 1995
85 Type inference with simple subtypes (context) - Mitchell - 1991
82 Coercion and type inference (context) - Mitchell - 1984
72 Sound polymorphic type inference for objects - Eifrig, Smith et al. - 1995
68 Subtyping constrained types - Trifonov, Smith - 1996
58 Type inference in the presence of overloading (context) - Kaes - 1992
52 Simplifying subtyping constraints - Pottier - 1996
43 Subtype inequalities (context) - Tiuryn - 1992
36 Principal type schemes for functional programs with overload.. - Smith - 1994
34 Polymorphic subtype inference: Closing the theory-practice g.. (context) - Fuh, Mishra - 1989
30 Lower bounds on type inference with subtypes (context) - Hoang, Mitchell - 1995
26 Efficient recursive subtyping - Kozen, Palsberg et al. - 1993
23 Constrained quantification in polymorphic type analysis (context) - Curtis - 1990
20 Type reconstruction with recursive types and atomic subtypin.. (context) - Tiuryn, Wand - 1993
19 Minimal typings in atomic subtyping - Rehof - 1997
18 Making set-constraint program analyses scale - Fahndrich, Aiken - 1996
18 Optimal representations of polymorphic types with subtyping - Aiken, Wimmers et al. - 1996
16 Satisfiability of inequalities in a poset - Pratt, Tiuryn
15 Algorithmic aspects of type inference with subtypes - Lincoln, Mitchell - 1992
13 Efficient type reconstruction in the presence of inheritance (context) - Benke - 1993
12 The independence property of a class of set constraints - Charatonik, Podelski - 1996
4 Some complexity bounds for subtype inequalities (context) - Benke - 1995
1 Moduar and polymorphic set-based analsysis: Theory and pract.. (context) - Flanagan, Felleisen - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.microsoft.com/~rehof/publications.html): More
Tractable Constraints in Finite Semilattices - Rehof, Mogensen (1996) (Correct)
From Polymorphic Subtyping to CFL Reachability.. - Fähndrich, Rehof (2000) (Correct)
\Delta -calculus - Rehof, Sørensen (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC