Skip to Main content Skip to Navigation
Conference papers

Subtyping Constraints for Incomplete Objects: (extended abstract)

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.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01154622
Contributor : Luigi Liquori <>
Submitted on : Friday, May 22, 2015 - 3:45:55 PM
Last modification on : Thursday, June 14, 2018 - 10:54:03 AM
Long-term archiving on: : Thursday, April 20, 2017 - 7:10:28 AM

File

1997-caap-fase-97.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

535

Files downloads

201