Luca Cardelli. Global computation. ACM SIGPLAN Notices, 32(1):66--68, January 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... immobile (e.g. waiting on a lock elsewhere in the system) 1 Introduction Background: Mobility and Location Independence Mobile computations units of executing computation that can migrate between machines are predicted to be an important enabling technology for future distributed systems [Car97, CHK97] To write applications involving mobility one would like high level location independent (LI) communication facilities, allowing the parts of an application to interact without explicitly tracking each other s movements. Such primitives have been provided by several languages, including ....

Luca Cardelli. Global computation. ACM SIGPLAN Notices, 32(1):66--68, January 1997.

....networks of virtually unlimited size, with many computers sending and receiving signals in sheer unpredictable ways. Along this line, one can envision the synthesis of large, world wide Internet like systems of communicating processors and networks to form myriads of programmable global computers ([9], 16] o ering many di erent qualities of service. There even are visions that over the next decades, new technologies will make it possible to assemble systems of huge numbers of computing elements that need not even all work correctly or be arranged in some prede ned or even computable way. ....

.... have any e ect on the computational power of the respective system Can the Church Turing thesis be adjusted to capture the new situation These questions have been arising recently within several communities, indicating the need for a revision of the classical Turing machine paradigm (see e.g. [9], 49] and [50] Wegner formulates it as follows ( 50] p. 318) The intuition that computing corresponds to formal computability by Turing machines . breaks down when the notion of what is computable is broadened to include interaction. Though Church s thesis is valid in the narrow ....

[Article contains additional citation context not shown here]

L. Cardelli. Global computation, ACM Sigplan Notices 32-1 (1997) 66-68.

....sites (principal sons of the root in the locations tree) and standard locations, and moves to sites are only allowed. But finer solutions could be better. Anyhow the previous proposition is the central property in the design of the distributed join calculus. Rephrasing Cardelli s terminology [9], our calculus has the two properties of network awareness, since we manipulate explicitly the locations and of network transparency, which states that no modification of the meaning of a term will arrive by giving explicit locations to terms of the join calculus. Unfortunately, but as expected, ....

L. Cardelli. Global computation. ACM Sigplan Notices, 32:1:66--68, 1997.

.... immobile (e.g. waiting on a lock elsewhere in the system) 1 Introduction Background: Mobility and Location Independence Mobile computations units of executing computation that can migrate between machines are predicted to be an important enabling technology for future distributed systems [Car97, CHK97] To write applications involving mobility one would like high level location independent (LI) communication facilities, allowing the parts of an application to interact without explicitly tracking each other s movements. Such primitives have been provided by several languages, including ....

Luca Cardelli. Global computation. ACM SIGPLAN Notices, 32(1):66-68, January 1997.

....system designer has two options, either split the files or structure the program as needed and risk having large amounts of unreachable code. For example, the libraries in the X Window system have been carefully structured to minimize procedures per file. Various schemes for managing C libraries [4] have been suggested. Most involve writing one procedure per file and present unnecessary 10 complications for the library implementor. The Eiffel [7] compiler from Interactive Software Engineering also attempts to minimize unreachable procedures. Eiffel code is first converted to an ....

James Coggins and Gregory Bollella, Managing C++ Libraries, ACM SIGPLAN Notices, June 1989.

....identically named classes in each subject correspond results in the cyclic class graph shown in Figure 7. We need a means to break such cycles that maintains the subtyping constraints required by each input subject. 3 The Approach Taking our cue from OO programming languages, such as Modula 3 [1], that explicitly separate the typing and implementation hierarchies, we can eliminate cycles in the generalization hierarchy while maintaining the necessary subtyping relationships that are required for the composed system to be compilable and type safe. There are two separate, but closely ....

Luca Cardelli, James Donahue, Lucille Glassman, Mick Jordan, Bill Kalsow, and Greg Nelson. Modula-3 report (revised). ACM SIGPLAN Notices, 27(8):15--42, August 1992.

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