D. Moon. Object-oriented programming with flavors. In OOPSLA, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....filters [AWB 94] all enable better control over modularization 17 of crosscutting concerns. A variety of models of AOP are presented in [CAC01] AspectJ [KHH 01] is an effort to develop a Java based language explicitly driven by the principles of AOP. Flavors [WM81, Can82] New Flavors [Moo86] CommonLoops [BKK 86] and CLOS [Ste90] all support before, after, and around methods. Andrews [And01] presents a semantics for AOP programs based on a CSP formalism, using CSP synchronization sets as join points. His language is an imperative language with first order procedures, like ours, ....

D. A. Moon. Object-oriented programming with Flavors. In Norman Meyrowitz, editor, Proceedings ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 1--8, New York, NY, November 1986. ACM Press.

....must be imported along with the macro. These symbols might have bindings as variables or functions completely divorced from their role in the macro. and if the importing program is using these symbols for its own functions or variables. a conflict will result. 46 LANG AND PEARLMUTTER Flavors [6, 15] it is possible to define a new flavor or add a method to an existing flavor only at compile time; it would be unthinkable to put a defmeth0d form inside a loop. To retain Lisp s uniform temporal semantics while fully supporting the object oriented paradigm, first class types are necessary. 6 ....

Moon, D.A. Object-oriented programming with Flavors. ACM Conference on Object-Oriented Systems, Programming, Languages and Applications, September 1986, pp. 1-8.

....as a combination of other elements in some sense, is symmetric to the functional advice problem. With functional advice, we are working in function space and know only a few combinators (e.g. before, after, and around) though others are easy to imagine (for example, consider mixins in Flavors [23]) With variables, we re working in variable space, and can think of a variety of combinators for example, the same as and di#erent examples, above, union for set valued fields, append for sequence valued ones, and so forth. 4.3 Program transformation Several authors have argued for ....

D. A. Moon. Object-oriented programming with flavors. In Proc. ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 1--8. ACM Press, Nov. 1986.

....We show how corresponding implementations in AspectJ look like and discuss their parallels and differences to the known mechanisms. 2 Concepts and Mechanisms in AspectJ 2. 1 Mixin Classes Originally, the term mixin class was introduced in object oriented extensions of Lisp like shown in [2] or [11]. A mixin is an abstract subclass that may be used to specialize the behavior of a variety of parent classes. Mixins don t have superclasses and are therefore not structurally bound to any specific place in the inheritance hierarchy. Just when a certain class extends a mixin, it becomes part of ....

....direct support for mixins on the language level. However, for example in C mixins can be implemented by a class template extending a class which is delivered by a type parameter (like proposed in [16] Also, the meta object facilities of Smalltalk can be used for implementing mixins as shown in [11]. Nevertheless, until now mixins are not available in Java on language level (although more recent proposals about adding generic types to Java like for example [2] will probably become part of Java in future versions and will permit a similar implementation of mixins like in C ) MImpl M.m1( ....

Moon, D. A.: Object-Oriented Programming with Flavors, Proceedings of Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA), 1986, pp. 1-8.

....objects [Tsichritzis et al. 1987] The principle idea is that KNOs are mobile, active entities that can gather information from their environment, and can exchange rules and knowledge with other KNOs. A system for defining KNOs [Casais 1988] has been implemented using the Lisp flavors package [Moon 1986]. In this system, KNOs belong to one or more KNO classes, and are able to dynamically inherit parts while they execute. The operations of a KNO are encoded as production rules, each consisting of a name, a trigger condition, and a series of actions. The actions may be used to modify a KNO s state, ....

....be the same as the environment in which it is used. Encapsulation may therefore be used to hide the implementation language. The practical alternatives are: 1. use an object oriented extension of an existing programming language (such as C [Stroustrup 1986] Objective C [Cox 1986] Lisp flavors [Moon 1986]) 2. use an object oriented language that is translated into the target programming language (such as Ei#el, which is translated into C [Meyer 1986] 3. use an object oriented language augmented with a package for interfacing to other languages within the programming environment (e.g. calling ....

D.A. Moon, "Object-Oriented Programming with Flavors", ACM SIGPLAN Notices Proceedings OOPSLA '86, vol. 21, no. 11, pp. 1-8, Nov 1986.

....is not expressive enough to factor out common features (i.e. instance variables and methods) shared by classes in a complex hierarchy. As a consequence, language designers have proposed various forms of multiple inheritance [Mey88] Kee89] Str86] as well as other mechanisms, such as mixins [Moo86] BC90] FKF98] that allow classes to be composed incrementally from sets of features. Despite the passage of nearly twenty years, neither multiple inheritance nor mixins have achieved wide acceptance [Tai96] Summarizing Alan Snyder s contribution to the inheritance panel discussion at OOPSLA ....

....complete. But as a unit of reuse, a class should be small. These properties often conflict. Furthermore, the role of classes as instance generators requires that each class have a unique place in the class hierarchy, whereas units of reuse should be applicable at arbitrary places. Moon s Flavors [Moo86] were an early attempt to address this problem: Flavors are small, not necessarily complete, and they can be mixed in at arbitrary places in the class hierarchy. More sophisticated notions of mixins were subsequently developed by Bracha and Cook [BC90] and Flatt, Krishnamurthi and Felleisen ....

David A. Moon. Object-oriented programming with flavors. In Proceedings OOPSLA '86, ACM SIGPLAN Notices, pages 1--8, November 1986. Published as Proceedings OOPSLA '86, ACM SIGPLAN Notices, volume 21, number 11.

....are both powerful and flexible. We believe that the object oriented approach is appropriate for addressing all three of these issues in a clean and consistent manner. This is in marked contrast to traditional object oriented languages and systems, such as Smalltalk [Gold83] and Lisp with flavors [Wein81 Moon86], which address neither strong typing nor concurrency. Hybrid starts with the object oriented approach as it is manifested in various systems existing today, and it adapts it to a model in which objects are both strongly typed and highly concurrent. Objects are structured, and may contain other ....

D.A. Moon, "Object-Oriented Programming with Flavors", ACM SIGPLAN Notices, vol. 21, no. 11, pp. 1-8, Nov 1986.

....abstraction and strong typing. University of Washington. Blac86] In Objects and Things, ed. D.C. Tsichritzis, Centre Universitaire d Informatique, University of Geneva, March 1987, pp. 183 206. Flavors: Lisp with object classes and multiple inheritance. There are now many flavours of flavors. [Moon86 Wein81] Galileo: An interactive object oriented language from Pisa University. Objects in Galileo are persistent. Alba85] Gemstone: An object oriented database system from Servio Logic. Also check Jan 1987 TOOIS. Maie85] Hybrid: A programming language with multiple inheritance and active ....

D.A. Moon, "Object-Oriented Programming with Flavors", ACM SIGPLAN Notices, vol. 21, no. 11, pp. 1-8, Nov 1986.

....mixins. 3.1.1 Introduction to Mixins The term mixin class (or just mixin ) has been overloaded to mean several specific programming techniques and a general mechanism that they all approximate. Mixins were originally explored in the context of the Lisp language with object systems like Flavors [Moo86] and CLOS [KRB91] They were defined as classes that allow their superclass to be determined by linearization of multiple inheritance. In C , the term has been used to describe classes in a particular (multiple) inheritance arrangement: as superclasses of a single class that themselves have a ....

D.A. Moon, "Object-Oriented Programming with Flavors", OOPSLA 1986.

....before the program runs, and it permits more efficient code to be generated by a compiler. Compile time checking can limit expressive power unless the programming language has a powerful type system; this issue is discussed further in Section 5. Other object oriented languages, e.g. 1] [13], do not enforce encapsulation at all. It is true that in the absence of language support encapsulation can be guaranteed by manual procedures such as code reading, but these techniques are error prone, and although the situation may be somewhat manageable for a newly implemented program, it will ....

Moon, D. "Object-Oriented Programming with Flavors". Proc. of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, SIGPLAN Notices 21, 11 (November 1986).

....the e#ect of wrappers by depending upon linearization to wrap the first parents around later ones [26] Adding an explicit wrapping construct to these languages would obviate the need for linearization and at the same time greatly simplify the behavior of multiple inheritance. Wrappers in Flavors [20] are used to wrap a particular method, and are not a record wrapping construct. 80 Related Work 11.1 Cardelli Cardelli [6] proposed a semantics of inheritance in which he identified inheritance with subtyping. His notion of record subtyping was presented in Chapter 4. Cardelli claimed that the ....

D. A. Moon. Object-oriented programming with Flavors. In Proc. of ACM Conf. on Object-Oriented Programming, Systems, Languages and Applications, pages 1--8, 1986.

....single dispatched methods (e.g. C and Smalltalk) On the other hand, a serious problem in multiple dispatching is the space requirement. Different method combinations can make the lookup structure to explode exponentially. Several previous work have been trying to resolve these problems [5, 12, 17, 20]. Some are time efficient, and some are space efficient,but never both. The work of this paper is to provide a novel lookup mechanism for multi methods. Our scheme absorbs and extends the ideas of previous work on multiple dispatching [5, 12] The lookup is done by means of several nested ....

....approach in Section 9. 2 Previous Work and Comparison The first goal of multiple dispatching is time efficiency. Several time efficient approaches have been proposed for multiple dispatching. However, the relevant problem is the large space requirement. For example, in the Flavors system, Moon [20] proposed a lookup structure which is organized as a set of hash tables. With such a scheme, the number of all possible cases is combinatorially explosive. For comparison, Dussud [15] and Kiczales, et al. 17] introduced cache techniques for multiple dispatching running in CLOS. The dynamic cache ....

MOON, D. Object Oriented Programming with Flavors. In Proc. Conf. OOPSLA, 1986.

No context found.

D. Moon. Object-oriented programming with flavors. In OOPSLA, 1986.

No context found.

D. A. Moon. Object-oriented programming with Flavors. In Proceedings of OOPSLA '86, pages 1--6. ACM, 1986.

No context found.

D.A. Moon. Object oriented programming with Flavors. In ACM Symp. on ObjectOriented Programming: Systems, Languages and Applications 1986.

No context found.

D. A. Moon. Object-oriented programming with Flavors. In Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA '86), pages 1--8, November 1986.

No context found.

David Moon. Object-Oriented Programming with Flavors. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 1-8, Portland, September/October 1986. Published as ACM SIGPLAN Notices 21(11), November 1986.

No context found.

D. Moon. Object-oriented Programming with Flavors. In OOPSLA '86, 1986.

No context found.

D. Moon. Object-oriented programming with Flavors. In OOPSLA, 1986.

No context found.

D. Moon. Object-oriented Programming with Flavors. In OOPSLA 1986.

No context found.

D. A. Moon. Object-oriented programming with Flavors. In OOPSLA, pages 1-8, 1986.

No context found.

D. A. Moon. Object-oriented programming with Flavors. In OOPSLA, 1986.

No context found.

D. A. Moon. Object-oriented programming with Flavors. In OOPSLA, pages 1--8, 1986.

No context found.

D. A. Moon, Object-oriented programming with flavors'. in N. Myerowitz (ed.). Proceedings of the ACM Conference on Object-Oriented Programming, Languages and Applications (OOPSLA'86). Special Issue of SIGPLAN Notices. 21. (11). (1986).

No context found.

D.A. Moon, "Object-Oriented Programming with Flavors", ACM SIGPLAN Notices, vol. 21, no. 11, pp. 1-8, Nov 1986.

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