Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Under consideration for publication in Math. Struct. in Comp. Science Polarized Subtyping for Sized Types
 

Summary: Under consideration for publication in Math. Struct. in Comp. Science
Polarized Subtyping for Sized Types
ANDREAS ABEL
Department of Computer Science, University of Munich
Oettingenstr. 67, D-80538 M®unchen, Germany
abel@tcs.ifi.lmu.de
Received March 15, 2006
We present an algorithm for deciding polarized higher-order subtyping without bounded
quantification. Constructors are identified not only modulo , but also . We give a direct proof of
completeness, without constructing a model or establishing a strong normalization theorem.
Inductive and coinductive types are enriched with a notion of size and the subtyping calculus is
extended to account for the arising inclusions between the sized types.
1. Introduction
Polarized kinding and subtyping has recently received interest in two contexts. First, in the anal-
ysis of container types in object-oriented programming languages (Duggan and Compagnoni,
1999): If List A is a functional (meaning: read-only) collection of objects of type A and A is
a subtype (subclass) of B then List A should be a subtype of List B. However, for read-write
collections, as for instance Array, such a subtyping relation is unsound
, hence these two col-
lection constructors must be kept apart. The conventional modeling language for object types,

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences