Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz  Home/Search
Context Related
Links: ACM DBLP | berkeley.edu/~aiken/public...popl02.pdf 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: berkeley.edu/~aike...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural 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 nonstructural 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... (Update)
Context of citations to this paper: More
...theory of structural subtyping of non recursive types. This result solves (for the case of non recursive types) a problem left open in [48]. 48] provides the decidability result for structural subtyping of only unary type constructors, whereas we solve the problem for any...
.... seemingly similar entailment problems [19,20] A tree automata based approach to non structural subtype entailment was proposed recently [21]. It is completely unrelated to the approach of the present paper, where we only deal with word automata. Tree automata are used in the...
Cited by: More
Structural Subtyping of Non-Recursive Types is Decidable - Kuncak, Rinard (2003) (Correct)
Subtype Constraints in Modal Logic - Niehren, Priesnitz (2005) (Correct)
Non-Structural Subtype Entailment in Automata Theory - Niehren, Priesnitz (2001) (Correct)
Similar documents (at the sentence level):
54.5%: The First-Order Theory of Subtype Constraints - Su, Aiken, Niehren.. (Correct)
48.4%: First-Order Theory of Subtyping Constraints - Su, Aiken, Niehren, Priesnitz (Correct)
Active bibliography (related documents): More All
0.4: Entailment with Conditional Equality Constraints - Su, Aiken (2001) (Correct)
0.4: Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999) (Correct)
0.3: Efficient Algorithms for General Classes of Integer Range.. - Su, Wagner (Correct)
Similar documents based on text: More All
0.6: Constraint Automata and the Complexity of Recursive Subtype.. - Henglein, Rehof (1998) (Correct)
0.4: The First-Order Theory of Ordering Constraints over Feature .. - Müller, Niehren, Treinen (2001) (Correct)
Related documents from co-citation: More All
6: The Complexity of Subtype Entailment for Simple Types - Henglein, Rehof - 1997
5: Mathematical Structures in Computer Science (context) - Kozen, Palsberg et al. - 1995
5: Satisfying Subtype Inequalities in Polynomial Space - Frey - 1997
BibTeX entry: (Update)
Z. Su, A. Aiken, J. Niehren, T. Priesnitz, and R. Treinen. The first-order theory of subtyping constraints. In POPL'02. http://citeseer.ist.psu.edu/591493.html More
@inproceedings{ su02firstorder,
author = "Zhendong Su and Alexander Aiken and Joachim Niehren and Tim Priesnitz and Ralf Treinen",
title = "The first-order theory of subtyping constraints",
booktitle = "Symposium on Principles of Programming Languages",
pages = "203-216",
year = "2002",
url = "citeseer.ist.psu.edu/591493.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978 DBLP
241 Decidability of Second-Order Theories and Automata on Infini.. (context) - Rabin - 1969
238 Pizza into Java: Translating theory into practice - Odersky, Wadler - 1997 DBLP
232 Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
228 Points-to Analysis in Almost Linear Time - Steensgaard - 1996 ACM DBLP
187 Type Inclusion Constraints and Type Inference - Aiken, Wimmers - 1993 ACM DBLP
165 Set Based Analysis of ML Programs (context) - Heintze - 1994
157 Soft Typing with Conditional Types - Aiken, Wimmers et al. - 1994 ACM DBLP
151 Object-Oriented Type Inference - Palsberg, Schwartzbach - 1991 ACM DBLP
129 ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
127 Control Flow Analysis in Scheme (context) - Shivers - 1988 ACM
118 Complete axiomatizations of the algebras of the finite (context) - Maher - 1988
102 Tree Automata Techniques and Applications - Comon, Dauchet et al. - 1999
88 A Type System Equivalent to Flow Analysis - Palsberg, O'Keefe - 1995 ACM DBLP
68 Subtyping Constrained Types - Trifonov, Smith - 1996 ACM DBLP
67 A Variant of a Recursively Unsolvable Problem (context) - Post - 1946
67 Componential Set-Based Analysis - Flanagan, Felleisen - 1997 ACM DBLP
52 Simplifying Subtyping Constraints - Pottier - 1996 ACM DBLP
47 Solving symbolic ordering constraints - Comon - 1990 DBLP
46 Akademiai Kiado (context) - Gecseg, Steinby - 1984
41 Catching Bugs in the Web of Program Invariants - Flanagan, Flatt et al. - 1996 ACM
36 A Practical Subtyping System For Erlang - Marlow, Wadler - 1997 ACM DBLP
31 Decidability of the purely existential fragment of the theor.. (context) - Venkataraman - 1987 ACM DBLP
30 A new method for undecidability proofs of first order theori.. - Treinen - 1992 ACM DBLP
29 The Complexity of Subtype Entailment for Simple Types - Henglein, Rehof - 1997 ACM DBLP
28 Making Set-Constraint Based Program Analyses Scale (context) - Fahndrich, Aiken - 1996
28 An automata-theoretic approach to presburger arithmetic cons.. - Wolper, Boigelot - 1995
28 Simplifying subtyping constraints: a theory - Pottier - 2000 DBLP
18 Optimal Representations of Polymorphic Types with Subtyping - Aiken, Wimmers et al. - 1997
15 Ordering constraints on trees - Comon, Treinen - 1994 ACM DBLP
15 The first-order theory of lexicographic path orderings is un.. - Comon, Treinen - 1997 ACM DBLP
13 The Complexity of Simple Subtyping Systems - Rehof - 1998
13 Constraint Automata and the Complexity of Recursive Subtype .. - Henglein, Rehof - 1998 ACM DBLP
11 Weak second order logic and finite automata (context) - Buchi - 1960
11 Presburger arithmetic and finite automata (context) - Boudet, Comon - 1996
11 Entailment of Atomic Set Constraints is PSPACE-Complete - Niehren, Muller et al. - 1999 ACM DBLP
9 The first-order theory of ordering constraints over feature .. (context) - Muller, Niehren et al. - 2001 ACM DBLP
8 Type Inference with Simple Types (context) - Mitchell - 1991
6 cient Inference of Partial Types (context) - Kozen, Palsberg et al. - 1994
5 cient Recursive Subtyping (context) - Kozen, Palsberg et al. - 1993
5 Entailment with conditional equality constraints - Su, Aiken - 2001 ACM DBLP
5 Predicate logic and tree automata with tests - Treinen - 2000 ACM DBLP
5 Entailment of NonStructural Subtype Constraints - Niehren, Priesnitz - 1999
4 Non-Structural Subtype Entailment in Automata Theory - Niehren, Priesnitz - 2001 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.berkeley.edu/~aiken/publications/publications.html): More
The Complexity of Set Constraints - Aiken, Kozen, Vardi, Wimmers (1993) (Correct)
Better Static Memory Management: Improving Region-Based.. - Aiken, al. (1995) (Correct)
Static Type Inference in a Dynamically Typed Language - Aiken, Murphy (1991) (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