Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

, , 1--48 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.

Summary: , , 1--48 ()
fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
Optimal Representations of Polymorphic Types
with Subtyping *
ALEXANDER AIKEN aiken@cs.berkeley.edu
EECS Department, University of California, Berkeley, Berkeley, CA 94720­1776
ED WIMMERS wimmers@almaden.ibm.com
IBM Almaden Research Center, 650 Harry Rd., San Jose, CA 95120­6099
JENS PALSBERG palsberg@cs.purdue.edu
Department of Computer Science, Purdue University, West lafayette, IN 47907
Editor: Carolyn Talcott
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 to be simplified by eliminating quantified variables. Eliminating variables both improves the
readability of types and the performance of algorithms whose complexity depends on the number
of type variables. We present an algorithm for simplifying quantified types in the presence of
subtyping and prove it is sound and complete for non­recursive and recursive types. We also show
that an extension of the algorithm is sound but not complete for a type language with intersection
and union types, as well as for a language of constrained types.


Source: Aiken, Alex - Department of Computer Science, Stanford University


Collections: Computer Technologies and Information Sciences