P. Van Roy, S. Haridi, P. Brand, G. Smolka, M. Mehl, R. Scheidhauer. Mobile objects in Distributed Oz. ACM Trans. on Progr. Languages and Systems, 19(5), Sep. 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... work has been done on mobility and distribution issues related to objectbased languages, systems, and environments (see, for example Eden [1] Emerald [2] and Obliq [3] More recently, such issues have been receiving attention from the object oriented community (see, for example, Distributed Oz [4]) In fact, the wide acceptance of object oriented environments and proposals, such as Java [5] and CORBA [6] has renewed interest in several issues related with class inheritance and object mobility in distributed architectures. In addition, there has been a general and wide discussion on how ....

....objects can move by following a DM policy and, on the other, 1= MODEPATH: home export mode =2= Configuration file: tryProject.jconf [see MODEPATH] 1] server bode.diee.unica.it ; 2] infocom vanessa.diee.unica.it , pamela.diee.unica.it [3] crs4 . crs4.it subdomian without proxy [4] diee .diee.unica.it proxy maxwell.diee.unica.it ; 3= Distribution file: tryProject.jdis [1] class OOPS implements IOOPS on crs4; 2] class BUBBLE implements IBUBBLE on server; 3] class Calendar implements ICalendar on infocom mobility DMV; 4= JMode source file: ....

[Article contains additional citation context not shown here]

Van Roy, P., Haridi, S., Brand, P., Smolka, G., Mehl, M., and Scheidahuer, R., "Mobile Objects in Distributed Oz," ACM Transactions on Programming Languages and Systems, Vol. 19(5), pp. 804-851, September, 1997.

....One of these is the PPAM [71] which is based on a dataflow model. Some of the important issues in implementing parallel abstract machines for programming languages are static and dynamic scheduling [19,114] granularity of tasks, distributed garbage collection [69] and code and thread migration [126,136]. 10. Special purpose abstract machines Abstract machines are not only used for translation of programming languages, but also as intermediate levels of abstraction for other purposes. Term rewriting [42] is a model of computation used in various areas of computer science, including symbolic ....

P. van Roy, S. Haridi, P. Brand, G. Smolka, M. Mehl, R. Scheidhauer, Mobile objects in distributed Oz, ACM Trans. Programming Languages Systems 19 (5) (1997) 804-- 851.

....among the network nodes via explicit actions [KarT98] However, the language constructs for mobility in those systems are still low level (basically, only go to primitives) and cannot express the logical relationships between different application components. An exception is Distributed Oz [Van97] that permits the association of allocation properties to application components and recognizes the necessity of separating algorithmic issues from allocation (distribution) ones. Because allocation properties focus on locality relationships between objects and disregards resource management ....

P. Van Roy et al., "Mobile Objects in Distributed Oz", ACM Transactions on Programming Languages and Systems, Vol. 19, No. 5, pp. 804-851, Sept. 1997.

....programming are concerned. Higher order polymorphic types (in contrast to ML type schemes) are required for data structures that embed polymorphic procedures, e.g. to describe modules, and for cells that contain polymorphic data structures. This is particularly useful in a distributed setting [39] since it enables one to send polymorphic procedures along a port which is impossible in ML. They are also required to type check certain higher order programming abstractions, for instance in the context of typed objectoriented programming; there, the combination of higher order polymorphic types ....

P. Van Roy, S. Haridi, P. Brand, G. Smolka, M. Mehl, R. Scheidhauer. Mobile objects in Distributed Oz. ACM Trans. on Progr. Languages and Systems, 19(5), Sep. 1997.

....not changed or removed. Because of monotonicity, a thread that is not blocked is guaranteed to stay not blocked until it executes its next statement. 2.1.2 The Oz Language. All Oz execution can be defined in terms of a kernel language whose semantics are outlined in Haridi and Franz en [1999] and Van Roy et al. 1997]. The current Oz language is called Oz 2 to distinguish it from an earlier language, Oz 1, whose kernel language is called the Oz Programming Model (OPM) Smolka 1995] Oz 1 was designed for fine grained concurrency and implicit exploitation of parallelism. Oz 2 abandons this model in favor of ....

....exception that is caught by the innermost enclosing scope. The full Oz language is defined by transforming all its statements into this kernel language. Oz supports idioms such as objects, classes, reentrant locks, and a 6 Delta Seif Haridi et al. variety of channels called ports [Smolka 1995; Van Roy et al. 1997]. The system implements them efficiently while respecting their definitions. We give a brief summary of each idiom s definition. For clarity, we have made small conceptual simplifications. Full definitions are given in Haridi and Franz en [1999] Object: An object is essentially a one argument ....

[Article contains additional citation context not shown here]

Van Roy, P., Haridi, S., Brand, P., Smolka, G., Mehl, M., and Scheidhauer, R. 1997. Mobile objects in Distributed Oz. ACM Trans. Program. Lang. Syst. 19, 5 (Sept.), 804--851.

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