Fritz Henglein, Jakob Rehof  Home/Search
Context Related
| microsoft.com/~rehof/icalp98.ps diku.dk/diku/semantics/pa...D394.ps.gz 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: cristal.inria.fr/~fpot...theseen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ordered set of possibly infinite labeled trees. The nonstructural ordering on trees is the one introduced by Amadio and Cardelli for subtyping with recursive types. The structural ordering compares only trees with common shape. A constraint set entails an inequality if every assignment of meanings (trees) to type expressions... (Update)
Context of citations to this paper: More
.... Rehof and Henglein showed that structural subtype entailment is coNP complete [7] for finite trees (simple types) and PSPACE complete [8] for possibly infinite trees (recursive types) Subtyping becomes non structural if the constants are admitted that stand for the least...
.... test has recently received some attention as a justification for constraint simplification and as a means to check type interfaces [4, 9, 10, 14, 22, 32]. Originally, weak subsumption has been introduced as a weakening of subsumption. The subsumption ordering between feature...
Cited by: More
Subtype Constraints in Modal Logic - Niehren, Priesnitz (2005) (Correct)
The First-Order Theory of Subtyping Constraints - Su, Aiken, Niehren, Priesnitz (Correct)
Non-Structural Subtype Entailment in Automata Theory - Niehren, Priesnitz (2001) (Correct)
Similar documents (at the sentence level):
15.0%: The Complexity of Simple Subtyping Systems - Rehof (1998) (Correct)
Active bibliography (related documents): More All
0.4: The Complexity of Subtype Entailment for Simple Types - Henglein, Rehof (1997) (Correct)
0.2: Type-Based Flow Analysis: From Polymorphic Subtyping to.. - Rehof, Fähndrich (2001) (Correct)
0.2: From Polymorphic Subtyping to CFL Reachability.. - Fähndrich, Rehof (2000) (Correct)
Similar documents based on text: More All
1.2: Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999) (Correct)
0.4: Safe polymorphic type inference for a Dynamically Typed.. - Henglein, Rehof (1995) (Correct)
0.3: Syntactic Properties of Polymorphic Subtyping - Henglein (1996) (Correct)
Related documents from co-citation: More All
12: The Complexity of Subtype Entailment for Simple Types - Henglein, Rehof - 1997
9: Simplifying subtyping constraints - Pottier - 1996
7: Subtyping constrained types - Trifonov, Smith - 1996
BibTeX entry: (Update)
Fritz Henglein and Jakob Rehof. Constraint automata and the complexity of recursive subtype entailment. In 25th International Colloquium on Automata, Languages, and Programming (ICALP'98), July 1998. URL: http://research.microsoft. com/~rehof/icalp98.ps. http://citeseer.ist.psu.edu/henglein98constraint.html More
@article{ henglein98constraint,
author = "Fritz Henglein and Jakob Rehof",
title = "Constraint Automata and the Complexity of Recursive Subtype Entailment",
journal = "Lecture Notes in Computer Science",
volume = "1443",
pages = "616--??",
year = "1998",
url = "citeseer.ist.psu.edu/henglein98constraint.html" }
Citations (may not include all citations):4212 Computers and Intractability -- A Guide to the Theory of NP-.. (context) - Garey, Johnson - 1979
1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
187 Type inclusion constraints and type inference - Aiken, Wimmers - 1993
129 ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
92 Subtyping recursive types - Amadio, Cardelli - 1991
85 Type inference with simple subtypes (context) - Mitchell - 1991
68 Subtyping constrained types - Trifonov, Smith - 1996
67 Componential set-based analysis - Flanagan, Felleisen - 1997
52 Simplifying subtyping constraints - Pottier - 1996
43 Subtype inequalities (context) - Tiuryn - 1992
36 A practical subtyping system for erlang - Marlow, Wadler - 1997
29 The complexity of subtype entailment for simple types - Henglein, Rehof - 1997
26 Efficient recursive subtyping - Kozen, Palsberg et al. - 1993
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. - 1997
13 The complexity of simple subtyping systems - Rehof - 1998
12 The independence property of a class of set constraints - Charatonik, Podelski - 1996
4 Personal communication (context) - Pratt - 1997
4 Personal communication (context) - Flanagan - 1997
1 Report on constraint automata and recursive subtype entailme.. (context) - Rehof - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cristal.inria.fr/~fpottier/biblio/these-en.html): More
Type Inference with Constrained Types - Sulzmann, Odersky, Wehr (1999) (Correct)
Minimal Typings in Atomic Subtyping - Rehof (1996) (Correct)
Making Set-Constraint Program Analyses Scale - Fähndrich, Aiken (1996) (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