Craig Chambers. Predicate classes. In ECOOP '93 -- Object-Oriented Programming, volume 707 of Lecture Notes in Computer Science, pages 268--296, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....migration control of [15] and enriched by the transition predicates, not su4 orted in [15] Transition predicates. They specify when objects may explicitly orau4F matically gain or lose roles from given classes. This is achieved throu ghru les in [18] The popu7 tion of the predicate classes of [6] is governed by membership predicates for the instances of the classes. Role classes can be created in [17] bymeansofpredicatescalledrole generating conditions, bu there are no transition predicates. For example, two predicate based classes HighlyPaidAcademic 656 Mo amed Dahch o r et al. and ....

C. Chambers. Predicate classes. In O. Nierstrasz, edito r, Proc. of the 7th European Conf. on Object-Oriented Programming, ECOOP'93, LNCS 707, pages 268--296, Kaiserslautern, Germany, 1993. Springer-Verlag. 655

....must be the same one for predefined types and any class type for references to objects (the DL system will check for constraint compatibility) The necessary attributes for a concrete class C are those defined in A B C the concrete class. An attribute that is not necessary is optional. As in [Chambers 93] all occurrences of attributes with the same name in a connected compound of the inheritance graph refer to the same attribute. 3 Description Logics Description Logics provide a possible underlying data model for our work. DL languages are characterised by their concepts constructors; here we ....

Craig Chambers, Predicate Classes, ECOOP'93

....while still belonging to the Alumnus class. In both cases, an instance of the transition relationship is created either explicitly by the user, or whenever it can be deduced automatically. An example of the latter is the case of a specialization defined by predicates on attribute values as in [Cha93] The generation mechanism di#ers from the transition mechanism in that the latter does not involve either creation or destruction of entities. Also, whereas in transition mechanism, the source and target object have the same identity, in generation mechanism the generated object has distinct ....

C. Chambers. Predicate classes. In Nierstrasz [Nie93], pages 268--296.

....cases, properties that do change are as important as properties that do not. Recognizing the benefit of capturing these changes, researchers have developed systems in which the type of the object changes as the values stored in its fields change or as the program invokes operations on the object [44, 43, 10, 47, 48, 4, 20, 13]. These systems integrate the concept of changing object states into the type system. The fundamental idea in this paper is that the state of each object also depends on the data structures in which it participates. Our type system therefore captures the referencing relationships that determine ....

.... updates of data structures [24] The object oriented community has long been aware of benefits that dynamically changing classes give in large systems [37] Recognizing these benefits, researchers have proposed dynamic techniques that change the class of an object to reflect its state changes [16, 20, 4, 13]. These systems illustrate the need for a static system that can verify the correct use of objects with changing roles. 10 Conclusion This paper proposes two key ideas: aliasing relationships should determine, in large part, the state of each object, and the type system should use the resulting ....

Craig Chambers. Predicate classes. In Oscar M. Nierstrasz, editor, Proceedings of the European Confer- ence on Object-Oriented Programming (ECOOP), vol- ume 707, pages 268-296, Berlin, Heidelberg, New York, Tokyo, 1993. Springer-Verlag.

....cases, properties that do change are as important as properties that do not. Recognizing the bene t of capturing these changes, researchers have developed systems in which the type of the object changes as the values stored in its elds change or as the program invokes operations on the object [44, 43, 10, 47, 48, 4, 20, 13]. These systems integrate the concept of changing object states into the type system. The fundamental idea in this paper is that the state of each object also depends on the data structures in which it participates. Our type system therefore captures the referencing relationships that determine ....

.... updates of data structures [24] The object oriented community has long been aware of bene ts that dynamically changing classes give in large systems [37] Recognizing these bene ts, researchers have proposed dynamic techniques that change the class of an object to re ect its state changes [16, 20, 4, 13]. These systems illustrate the need for a static system that can verify the correct use of objects with changing roles. 10 Conclusion This paper proposes two key ideas: aliasing relationships should determine, in large part, the state of each object, and the type system should use the resulting ....

Craig Chambers. Predicate classes. In Oscar M. Nierstrasz, editor, Proceedings of the European Conference on Object-Oriented Programming (ECOOP), volume 707, pages 268-296, Berlin, Heidelberg, New York, Tokyo, 1993. Springer-Verlag.

....by C objects. A C object may be explicitly attached to a B object, or it may be implicitly attached to a group of B objects for the duration of a method invocation. In Rondo [24] the behavior of single objects can be altered at runtime by means of so called adjustments. With predicate classes [10], an object is automatically an instance of a predicate class whenever it satisfies a predicate expression associated with the predicate class. If an object is modified, the classification of an object can change, yielding in a di#erent behavior of the object. There have been a number of ....

C. Chambers. Predicate classes. In W.Oltho#, editor, Proceedings ECCOP '93, LNCS 707, pages 268--297. Springer, 1993.

....in [30] classes have modes representing di erent states, e.g. opened vs. iconi ed window. Wide classes [29] allow an object to be temporarily widened or shrunk , i.e. become an object of a subclass or superclass, requiring run time tests for the presence of elds. Predicate classes [10, 14] extend multimethods, suggesting method dispatch depending on predicates on the receiver and argument. We take a programming perspective, and base our approach on an imperative, class based language, where classes are types and subclasses are subtypes, 1 and where methods are de ned inside ....

....The main questions in [17] are type inference, and establishing that functions are well de ned, that is they cover all possible cases. Side e ects are not considered, therefore questions like aliasing that are central to our development do not arise. The practical perspective Predicate classes [10, 14], on an imperative setting, suggest multi method dispatch depending on predicates on the receiver and ar12 guments. Code is broken down per function while Fickle follows the mainstream, whereby code is broken down per class. In [10] the term re classi cation denotes changes in attribute values ....

[Article contains additional citation context not shown here]

C. Chambers. Predicate Classes. In ECOOP'93, volume 707 of LNCS, pages 268-296. Springer, 1993.

....limitation of object oriented programming. Fickle [4] is a Java like language supporting dynamic object re classi cation, aimed at illustrating features for object re classi cation which could extend an imperative, typed, class based, objectoriented language. Other approaches have been attempted [3, 6, 7]; however, Fickle is more within the main stream of the object oriented approach, and moreover it is type safe, in the sense that any type correct program (in terms of the Fickle type system) is guaranteed never to access non existing elds or methods. A further problem is how to construct, ....

C. Chambers. Predicate Classes. In ECOOP'93, volume 707 of LNCS, pages 268{

....cases, properties that do change are as important as properties that do not. Recognizing the bene t of capturing these changes, researchers have developed systems in which the type of the object changes as the values stored in its elds change or as the program invokes operations on the object [45, 44, 10, 51, 52, 6, 18, 11]. These systems integrate the concept of changing object states into the type system. The fundamental idea in this paper is that the type of each object should also depend on the data structures in which it participates. Our type system therefore captures the referencing relationships that ....

....and the heap at each program point. The object oriented community has long been aware of the bene ts of dynamically changing classes in large systems [36] Recognizing these bene ts, researchers have proposed dynamic techniques that change the class of an object to re ect its state changes [18, 6, 11, 14, 1, 53, 47]. These systems illustrate the need for a static system that can verify the correct use of objects with changing roles. The presence of aliasing makes it dicult to enforce encapsulation in object oriented languages. Motivated by this problem, researchers have developed several systems [22, 2, 8, ....

Craig Chambers. Predicate classes. In Proceedings of the 7th European Conference on Object-Oriented Programming, pages 268-296, 1993.

....cases, properties that do change are as important 1 as properties that do not. Recognizing the bene t of capturing these changes, researchers have developed systems in which the type of the object changes as the values stored in its elds change or as the program invokes operations on the object [44, 43, 10, 47, 48, 4, 20, 13]. These systems integrate the concept of changing object states into the type system. The fundamental idea in this paper is that the state of each object also depends on the data structures in which it participates. Our type system therefore captures the referencing relationships that determine ....

.... updates of data structures [24] The object oriented community has long been aware of bene ts that dynamically changing classes give in large systems [37] Recognizing these bene ts, researchers have proposed dynamic techniques that change the class of an object to re ect its state changes [16, 20, 4, 13]. These systems illustrate the need for a static system that can verify the correct use of objects with changing roles. 10 Conclusion This paper proposes two key ideas: aliasing relationships should determine, in large part, the state of each object, and the type system should use the resulting ....

Craig Chambers. Predicate classes. In Proceedings of the 7th European Conference on Object-Oriented Programming, pages 268-296, 1993.

.... TOSCA Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi. 2 Partially supported by EPSRC (Grant Ref:GR L 76709) Preprint submitted to Elsevier Preprint 12 November 2001 feature of Fickle, with respect to other proposals for dynamic object reclassi cation (see, e.g. [2,4,5]) is that it is type safe, in the sense that any type correct program is guaranteed never to access non existing elds or methods. Fickle is essentially a small subset of Java (with only non abstract classes, instance elds and methods, integer and boolean types and a minimal set of statements ....

C. Chambers. Predicate Classes. In ECOOP'93, volume 707 of LNCS, pages 268-296. Springer, 1993.

No context found.

Craig Chambers. Predicate classes. In ECOOP '93 -- Object-Oriented Programming, volume 707 of Lecture Notes in Computer Science, pages 268--296, 1993.

No context found.

C. Chambers. Predicate Classes. In European Conference on Object-Oriented Programming, 1993.

No context found.

Chambers, C. 1993. Predicate Classes. In ECOOP'93. LNCS, vol. 707. Springer, Berlin, 268-296. Chambers, C. and Leavens, G. 1995. Type Checking Modules for Multimethods. ACM Transactions on Programming Languages and Systems 17, 6, 805-843.

No context found.

C. Chambers. Predicate Classes. In ECOOP'93, volume 707 of LNCS, pages 268--296, Berlin, 1993. Springer.

No context found.

C. Chambers. Predicate Classes. In O. Nierstrasz, editor, ECOOP'93, volume 707 of LNCS, pages 268--296. Springer, 1993.

No context found.

Craig Chambers. Predicate classes. In ECOOP'93 Conference Proceedings, 1993.

No context found.

C. Chambers. Predicate classes, in: Proceedings of the ECOOP'93, volume 707 of Lecture Notes in Computer Science, pages 268--296, Kaiserslautern, Germany, July 1993.

No context found.

Craig Chambers. Predicate Classes. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP), Kaiserslautern, July 1993. Published as Lecture Notes in Computer Science (LNCS) 707:268-296, Springer-Verlag, 1993.

No context found.

C. Chambers. Predicate Classes. In ECOOP'93, volume 707 of LNCS, pages 268--296, Berlin, 1993. Springer.

No context found.

Craig Chambers. Predicate Classes. In ECOOP '93. European Conference on ObjectOriented Programming, Kaiserslautern, Germany, July 1993.

No context found.

C. Chambers. Predicate Classes. In O. Nierstrasz, editor, ECOOP'93, volume 707 of LNCS, pages 268--296. Springer, 1993.

No context found.

C. Chambers. Predicate Classes. In ECOOP'93, volume 707 of LNCS, pages 268--296. Springer, 1993.

No context found.

C. Chambers. Predicate Classes. In Proceedings of the 7th European Conference on Object-Oriented Programming (ECOOP'93), Lecture Note Computer Science, Vol. 707, Springer-Verlag, pages 268-296, July 1993.

No context found.

Chambers, C. Predicate Classes. ECOOP 1993.

First 50 documents  Next 50

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