Subtyping Constraints for Incomplete Objects - Archive ouverte HAL Access content directly
Conference Papers Year : 1997

Subtyping Constraints for Incomplete Objects

(1) , (2) , (1) , (1, 3, 4)
1
2
3
4

Abstract

We extend the type system for the Lambda Calculus of Objects [14] to account for a notion of width subtyping. The main novelties over previous work are the use of bounded quantification to achieve a new and more direct rendering of MyType polymorphism, and a uniform treatment for other features that were accounted for via different systems in subsequent extensions [7, 6] of [14]. In particular, the new system provides for (i) appropriate type specialization of inherited methods, (ii) static detection of errors, (iii) width subtyping compatible with object extension, and (iv) complete freedom in the order of method addition.
Fichier principal
Vignette du fichier
1997-caap-fase-97.pdf (299.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01154622 , version 1 (22-05-2015)

Identifiers

Cite

Viviana Bono, Michele Bugliesi, Mariangiola Dezani-Ciancaglini, Luigi Liquori. Subtyping Constraints for Incomplete Objects: (extended abstract). TAPSOFT '97: Theory and Practice of Software Development 7th International Joint Conference CAAP/FASE Lille, France, April 14–18, 1997 Proceedings, Apr 1997, Lille, France. pp.465-477, ⟨10.1007/BFb0030619⟩. ⟨hal-01154622⟩

Collections

INRIA INRIA2
164 View
65 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More