MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  A Type System for Record Concatenation and Subtyping

Download:
Download as a PDF | Download as a PS
unknown authors
http://www.cs.kun.nl/~janz/publications/type_check.ps
Add To MetaCart

Abstract:

We define a second-order type system with records, record concatenation and subtyping. The aim of this system is to model the most important concepts in object-oriented languages. The novelty in our approach is that record concatenation is controlled by a relation called compatibility. This relation is flexible enough to solve the polymorphic record update problem with concatenation, and restrictive enough to keep the theoretical properties relatively simple. In this article, we prove many of these properties and show that type checking is decidable. 1

Citations

762 On understanding types, data abstraction, and polymorphism – Cardelli, Wegner - 1985
444 Lambda calculi with types – Barendregt - 1991
182 Simple type-theoretic foundations for object-oriented programming – Pierce, Turner - 1994
154 Operations on records – Cardelli, Mitchell - 1989
143 Complete type inference for simple objects – Wand - 1987
120 Type inference for record concatenation and multiple inheritance – Wand - 1989
70 Programming with Intersection Types and Bounded Polymorphism – Pierce - 1991
62 A record calculus based on symmetric concatenation – Harper, Pierce - 1991
39 Extensible records in a pure calculus of subtyping – Cardelli - 1994
33 Notes on Typed Object-Oriented Programming – Fisher, Mitchell - 1994
26 Polarized Higher-Order Subtyping – Steffen - 1994
18 A new type-assignment for -terms – Coppo, Dezani-Ciancaglini - 1978
9 Subtyping in F ! is decidable – Compagnoni - 1994
4 Record concatenation with intersection types – Zwanenburg - 1995
2 System F with Width-subtyping and Record Updating – Poll - 1997
View or Download | Add to My Collection | Correct Errors