The Complexity of Simple Subtyping Systems

The Complexity of Simple Subtyping Systems (1998)

Cached

Download Links

[130.225.96.4]

by Jakob Rehof

Citations:

14 - 3 self

BibTeX

@TECHREPORT{Rehof98thecomplexity,
    author = {Jakob Rehof},
    title = {The Complexity of Simple Subtyping Systems},
    institution = {},
    year = {1998}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
874	A theory of type polymorphism in programming - Milner - 1978
474	Lambda Calculi with Types - Barendregt - 1992
295	Concepts in Programming Languages - Mitchell - 2003
288	Subtyping recursive types - Amadio, Cardelli
285	A unified approach to global program optimization - Kildall - 1973
266	The Lambda Calculus: its syntax and semantics, volume 103 of Studies in logic and the foundations of mathematics - Barendregt - 1985
258	Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae - Dowling, Gallier - 1984
221	Principal type schemes for functional programs - Damas, Milner - 1982
203	Type inclusion constraints and type inference - Aiken, Wimmers - 1993
131	Fundamental properties of infinite trees - Courcelle - 1983
108	Componential set-based analysis - Flanagan, Felleisen - 1997
106	Partial online cycle elimination in inclusion constraint graphs - Fähndrich, Foster, et al. - 1998
99	Sound polymorphic type inference for objects - Eifrig, Smith, et al. - 1995
96	Polymorphic type inference and containment - MITCHELL - 1988
95	Type inference with simple subtypes - Mitchell - 1991
92	Type Assignment in Programming Languages - Damas - 1984
74	P.: Type inference with subtypes - Fuh, Mishra - 1988
53	Efficient Inference of Partial Types - Kozen, Palsberg, et al. - 1994
49	Type checking higher-order polymorphic multi-methods - Bourdoncle, Merz - 1997
48	Tractable Constraints in Finite Semilattices,” Third International Static Analysis Symposium - Rehof, Mogensen - 1996
44	Efficient recursive subtyping - Kozen, Palsberg, et al. - 1993
44	A practical subtyping system for Erlang - Marlow, Wadler - 1997
37	Coercion and type inference (summary - Mitchell - 1984
37	Flow Analysis of Typed Higher-Order Programs - MOSSIN - 1997
33	Polymorphic subtype inference: Closing the theory-practice gap - Fuh, Mishra - 1989
30	On the cubic bottleneck in subtyping and flow analysis - Heintze, McAllester - 1997
27	Set constraints with intersection - Charatonik, Podelski - 1997
26	Interconvertbility of set constraints and context-free language reachability - MELSKI, REPS - 1997
25	Algorithmic aspects of type inference with subtypes - Lincoln, Mitchell - 1992
23	Constrained quantification in polymorphic type analysis - Curtis - 1990
18	Optimal representations of polymorphic types with subtyping - Aiken, Wimmers, et al. - 1997
18	Satisfying subtype inequalities in polynomial space - Frey - 2002
16	Efficient type reconstruction in the presence of inheritance - Benke - 1993
16	Making set-constraint program analyses scale - Fahndrich, Aiken - 1996
8	Algebraic structures with hard equivalence and minimization problems - Bloniarz, Hunt, et al.
4	Some complexity bounds for subtype inequalities - Benke - 1995
3	The word and generator problem for lattices - Cosmadakis - 1988
1	Subtyping and the cubic time bottleneck. Preliminary draft - Aiken, Henglein, et al. - 1997
1	Satisfiability of subtype inequalities in structural infinite terms over lattices in PTIME. Unpublished note - Frey - 1997
1	Preunification and precongruence closure: Algorithms and applications. Preliminary draft - Henglein - 1992
1	Conjunctive subtyping - Lillie - 1993