Alexander Aiken, et al.  Home/Search
Context Related
| purdue.edu/homes/palsber...tacs97.ps.gz purdue.edu/homes/palsber...hosc99.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: purdue.edu/homes/p...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Alexander Aiken 1? and Edward L. Wimmers 2 and Jens Palsberg 3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Center, 650 Harry Rd., San Jose, CA 95120-6099. 3 Department of Computer Science, Purdue University, West Lafayette, IN 47907. Abstract. Many type inference and program analysis systems include notions of subtyping and parametric polymorphism. When used together, these two features induce equivalences that allow types ... (Update)
Context of citations to this paper: More
.... in the typings generated by subtype inference algorithms; works addressing the subtype simplification problem in clude [28, 17, 41, 67, 21, 59, 73, 22, 4, 25]. As is argued in [4] simplification is beneficial for at least three reasons: first, it may speed up type inference,...
...of the implementation. The eciency of a type system with sub typing relies deeply on the simpli cation of sub typing constraints [2,9]. We apply classical techniques for eliminating intermediate variables in constraints. Moreover, due to the simple type language, we apply...
Cited by: More
Compaction Algorithm for Precise Modular.. - Kim, Nystrom, Barnes.. (Correct)
The First-Order Theory of Subtyping Constraints - Su, Aiken, Niehren, Priesnitz (Correct)
Entailment of Set Constraints is not Feasible - Müller, Niehren (1997) (Correct)
Similar documents (at the sentence level):
61.9%: Optimal Representations of Polymorphic Types with Subtyping - Aiken, Wimmers, Palsberg (1996) (Correct)
Active bibliography (related documents): More All
0.5: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.2: Minimal Typings in Atomic Subtyping - Rehof (1996) (Correct)
0.2: The Complexity of Subtype Entailment for Simple Types - Henglein, Rehof (1997) (Correct)
Similar documents based on text: More All
0.1: Negative Set Constraints With Equality - Charatonik, Pacholski (1994) (Correct)
0.1: Set constraints with projections are in NEXPTIME - Charatonik, Pacholski (1994) (Correct)
0.1: Safe-A Semantic Technique for Transforming Programs in.. - Aiken, Williams, Wimmers (1995) (Correct)
Related documents from co-citation: More All
13: Subtyping constrained types - Trifonov, Smith - 1996
13: Componential set-based analysis - Flanagan, Felleisen - 1997
12: Simplifying subtyping constraints - Pottier - 1996
BibTeX entry: (Update)
A. Aiken, E.L. Wimmers, and J. Palsberg. Optimal representations of polymorphic types with subtyping. Technical Report UCB/CSD-96-909, University of California, Berkeley, July 1996. http://citeseer.ist.psu.edu/article/aiken96optimal.html More
@inproceedings{ aiken97optimal,
author = "Alexander Aiken and Edward L. Wimmers and Jens Palsberg",
title = "Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract)",
booktitle = "Theoretical Aspects of Computer Software",
pages = "47-76",
year = "1997",
url = "citeseer.ist.psu.edu/article/aiken96optimal.html" }
Citations (may not include all citations):342 data abstraction and polymorphism (context) - Cardelli, Wegner et al. - 1985
187 Type inclusion constraints and type inference - Aiken, Wimmers - 1993
157 Soft typing with conditional types - Aiken, Wimmers et al. - 1994
129 ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
72 Sound polymorphic type inference for objects - Eifrig, Smith et al. - 1995
58 Type inference in the presence of overloading (context) - Kaes - 1992
52 Simplifying subtyping constraints - Pottier - 1996
49 Polymorphic binding-time analysis (context) - Henglein, Mossin - 1994
36 Principal type schemes for functional programs with overload.. - Smith - 1994
23 Constrained quantification in polymorphic type analysis (context) - Curtis - 1990
18 Optimal representations of polymorphic types with subtyping - Aiken, Wimmers et al. - 1996
18 Making set-constraint program analyses scale - Fahndrich, Aiken - 1996
14 An ideal model for recursive polymophic types (context) - MacQueen, Plotkin et al. - 1984
12 Infinite trees in normal form and recursive equations having.. (context) - Courcelle - 1979
5 An anecdote about ML type inference (context) - Koenig - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.purdue.edu/homes/palsberg/publications.html): More
Safety Analysis versus Type Inference for Partial Types - Palsberg, Schwartzbach (1992) (Correct)
Comparing Flow-based Binding-time Analyses - Palsberg (1995) (Correct)
Normal Forms have Partial Types - Palsberg (1993) (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