K. B. Bruce, A. Fiech, and L. Petersen. Subtyping is not a good \Match" for object-oriented languages. In Proceedings of the European Conference on ObjectOriented Programming, pages 104-127, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Products and Polymorphic Subtypes - Bono, Tiuryn (2001) (Correct)
....Subtyping, Cartesian Product, Logical Semantics, Sequent. 1 Introduction The notion of subtyping is one of the most important concepts introduced in the theory of functional languages (see, for example, 4 7] Moreover, it plays an important role in object oriented languages (see, for example, [1 3, 8]) for which Supported by Polish KBN Grant 8 T11C 035 14 and Polish KBN Grant 8 T11C 028 20. it provides a typed counterpart of the substitutivity concept, that essentially allows to treat an object with a certain set of functionalities also as an object that has a subset of such ....
K.B. Bruce, L. Petersen, and A. Fiech. Subtyping is not a Good \Match" for Object-Oriented Languages. In Proceedings of ECOOP'97, volume 1241 of LNCS, pages 104-127. Springer{Verlag, 1997.
A Lambda Calculus of Objects with Self-Inflicted Extension - Di Gianantonio, al. (1998) (3 citations) (Correct)
....relation, to deal with subsumption. By introducing the sub kind of rigid types, we make the matching relation compatible with subsumption, and hence we can make it play the role of the width subtyping relation. This is in sharp contrast with the uses of matching proposed so far in literature ([11, 10, 3]) Hence we can suggestively say that in our type assignment system matching is a relation on types compatible with a limited subsumption rule . 4.1 Extra Rules for Subsumption Extra rules for the obj types are necessary. Most of these rules are simply a rephrasing of the rules presented so ....
K. Bruce, L. Petersen, and A. Fiech. Subtyping Is Not a Good \Match" for Object-Oriented Languages. In Proc. of ECOOP, volume 1241 of Lecture Notes in Computer Science, pages 104-127. Springer-Verlag, 1997.
A Core Calculus of Classes and Objects - Bono, Patel, Shmatikov, Mitchell (1999) (2 citations) (Correct)
....types to follow the standard constraints on recursive types, while object types employ standard subtyping. PolyTOIL also has imperative updating of object elds, but inheritance is still modeled with MyType in order to support binary methods. The drawback is the complexity of the type system. In [12], another language is presented, Loom, where only matching is used and the type system is simpli ed. This paper is an attempt to build a simpler class based calculus. The absence of MyType makes it weaker, but imperative updating appears sucient to model the desirable features that are needed in ....
Bruce, K. B., L. Petersen and A. Finch, Subtyping is not a good \match" for object-oriented languages, in: Proc. ECOOP '97 (1997), pp. 104-127.
An Object Calculus With Views - Vouillon (Correct)
....method names. 9 2.3 Type system An environment contains both value bindings and view bindings. It also contains what we call matching hypothesis, that is the hypothesis that a type has at least the set of views K (this is not the same notion of matching as the one introduced by Kim Bruce [BFP97] but the two notions have similarities: types that match a given set of views have a similar shape, but are not necessarily subtypes of a same type) Empty environment j ; x : Value binding j ; # K) Matching hypothesis j ; k : t) View binding j ; k) Abstract view binding We make ....
Kim B. Bruce, Adrian Fiech, and Leaf Petersen. Subtyping is not a good \match" for object-oriented languages. In ECOOP, number 1241 in LNCS, pages 104-127. Springer-Verlag, 1997. 20
PolyTOIL: A type-safe polymorphic object-oriented language - Bruce, Fiech (1995) (90 citations) Self-citation (Bruce Fiech) (Correct)
....dropping matching. Because of our experience we have come to the opposite conclusion: subtyping is not as useful as matching (as long as we provide a mechanism to support heterogeneous data structures) Research with Leaf Petersen resulted in the design of an object oriented language, LOOM, BFP97] that supports matching, but not subtyping, while still providing sucient expressiveness for programmers. A key feature of this language is the provision of type expressions that allow the programmer to express that a value can have any type that matches a given expression. We have been at work ....
Kim B. Bruce, Adrian Fiech, and Leaf Petersen. Subtyping is not a good \match" for object-oriented languages. In ECOOP '97, pages 104-127. LNCS 1241, SpringerVerlag, 1997.
A Nominal Theory of Objects with Dependent Types - Odersky, Cremet, Röckl, Zenger (2002) (5 citations) (Correct)
No context found.
K. B. Bruce, A. Fiech, and L. Petersen. Subtyping is not a good \Match" for object-oriented languages. In Proceedings of the European Conference on ObjectOriented Programming, pages 104-127, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC