Atsushi Ohori and Kazuhiko Kato. Semantics for communication primitives in a polymorphic language. In Twentieth ACM Symposium on Principles of Programming Languages, pages 99--112, Charleston, SC, January 1993. Association for Computing Machinery.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....language that integrates a concurrent calculus with ML. It allows passing ML modules across the heterogeneous network and execute them native by using dynamic compiler and linker. It does not support distributed address space and is incapable to send closures across the network. The dML [10] incorporates dynamic types in the ML type system and proposes a theoretical foundation of inter node communication between independent ML programs but it does not suggest an efficient implementation technique. Kali Scheme [6] and NeXeme [9] are distributed dialects of Scheme and Obliq [4] is a ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In POPL'93, pages 99--112, 1993.

....Consequently, one is able to define polymorphic array operations, such as mapping and reducing, which work for arrays of arbitrary shape, without having to fix the shape in advance. This appears to be in conflict with the well known incompatibility of references and polymorphism ( Tof88] and also [OK93]) but in FISh all polymorphism is instantiated statically, before execution. The function type 1 2 represents functions from 1 to 2 . When 2 = comm the result is a procedure. A ground type is a phrase type which is not a function type. Note that although FISh supports functions of ....

A. Ohori and K Kato. Semantics for communication primitives in a polymorphic language. In POPL '93: The 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 99--112. ACM Press, 1993.

....the confluence and strong normalization properties of the # P i type system. 3. 1 Example: Marshalling One of the examples that Harper and Morrisett [8] use to illustrate the power of intensional type analysis is based on the extension of ML for distributed computing proposed by Ohori and Kato [14]. The idea is to convert values into a form which can be used for transmission over a network. An integer value may be transmitted directly, but a function may not; instead, a globally unique identifier is transmitted that serves as a proxy at the remote site. These identifiers are associated with ....

....: #, x : # ## in e # : # # The polymorphic equality function eq is defined in Figure 7 (we use a letrec construct derived from our fix) The domain type of the function is restricted to types of the form Eq # to ensure that only values of types admitting equality are compared. 1 Ohori and Kato [14] define one primitive for creating identifiers for both term and type abstraction. letrec heq : ## :# . ## # :# . Eq# # Eq # # # Bool = ## :# . ## # :# . typecase[## :# . Eq # # Eq # # # Bool] # of Bool # #x : Bool. typecase[## :# . Eq # # Bool] # # of Bool # #y : ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Proc. 20th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pages 99--112. ACM Press, 1993.

....or more recently Pict and other # calculus based languages [7, 27, 34, 13] As formalisms, we have CCS [19] Theoretical CSP [10] # calculus [22] and other process algebras. In another vein, we have functional programming languages augmented with communication primitives, such as CML [30] dML [25], and Concurrent Haskell [15] In these languages and formalisms, various communication primitives have been o#ered (such as synchronous asynchronous message passing, remote procedure call, method call and rendez vous) and the description of communication behaviour is done by combining these ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. POPL 93. ACM Press, 1993.

....selectively distribute local access rights to principals throughout the network, and this distribution will be respected without compromising local resources, even in the presence of malicious agents. Several studies have addressed the issue of static typing for languages with remote resources [25, 5, 30, 17], but none of these address secure resources or open networks. Proof carrying code and related techniques [37, 22, 18, 21] address the problem of runtime typechecking in open networks, but do not consider either secure resources or references to remote resources. Type systems have been used to ....

Atsuhi Ohori and Kazuhiko Kato. Semantics for communication primitives in a polymorphic language. In Conference Record of the ACM Symposium on Principles of Programming Languages, Charleston, January 1993. ACM Press.

....The former would be similar to our locations, the later, our resources. This discipline would open the possibility of typing code during in and out operations, rather than open. Several studies have addressed the issue of static typing for languages with remote resources; some recent papers are [20, 6, 24]. Perhaps the work closest to ours is that of Knabe [14] who has implemented an extension of Facile which supports mobile agents. The main extensions are remote signatures and proxy structures, which are somewhat related to our location types. None of these works address open systems, however. On ....

Atsuhi Ohori and Kazuhiko Kato. Semantics for communication primitives in a polymorphic language. In Conference Record of the ACM Symposium on Principles of Programming Languages, Charleston, January 1993. ACM Press.

....or more recently Pict and other calculus based languages [7, 12, 24, 30] As formalisms, we have CCS [16] Theoretical CSP [9] calculus [19] and other process algebras. In another vein, we have functional programming languages augmented with communication primitives, such as CML [27] dML [22], and Concurrent Haskell [13] In these languages and formalisms, various communication primitives have been offered (such as synchronous asynchronous message passing, remote procedure call, method call and rendez vous) and the description of communication behaviour is done by combining these ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. POPL 93. ACM, 1993.

....The former would be similar to our locations, the later, our resources. This discipline would open the possibility of typing code during in and out operations, rather than open. Several studies have addressed the issue of static typing for languages with remote resources; some recent papers are [21, 7, 23]. Perhaps the work closest to ours is that of Knabe [15] who has implemented an extension of Facile which supports mobile agents. The main extensions are remote signatures and proxy structures, which recall our location types. None of these works address open systems, however. On the other hand, ....

Atsuhi Ohori and Kazuhiko Kato. Semantics for communication primitives in a polymorphic language. In Conference Record of the ACM Symposium on Principles of Programming Languages, Charleston, January 1993. ACM Press.

....interpretation of the product type appropriately. A rigorous formulation of the target language extended with n tuples is tedious, but appears to be straightforward. 3. 2 Marshalling Ohori and Kato give an extension of ML with primitives for distributed computing in a heterogeneous environment [39]. Their extension has two essential features: one is a mechanism for generating globally unique names ( handles or capabilities ) that are used as proxies for functions provided by servers. The other is a method for representing arbitrary values in a form suitable for transmission through a ....

....an rpc on the identifier and argument, takes the result and unmarshalls it. The M and U functions are used in the translation of client phrases that import a server s function and in the translation of server phrases that export functions. The reader is encouraged to consult Ohori and Kato s paper [39] for further details. 3.3 Type Classes The language Haskell [25] provides the ability to define a class of types with associated operations called methods. The canonical example is the class of types that admit equality (also known as equality types in SML [33, 19] Consider adding a ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Twentieth ACM Symposium on Principles of Programming Languages, pages 99-- 112, Charleston, SC, Jan. 1993. Association for Computing Machinery.

....The former would be similar to our locations, the later, our resources. This discipline would open the possibility of typing code during in and out operations, rather than open. Several studies have addressed the issue of static typing for languages with remote resources; some recent papers are [20, 6, 22]. Perhaps the work closest to ours is that of Knabe [14] who has implemented an extension of Facile which supports mobile agents. The main extensions are remote signatures and proxy structures, which recall our location types. None of these works address open systems, however. On the other hand, ....

Atsuhi Ohori and Kazuhiko Kato. Semantics for communication primitives in a polymorphic language. In Conference Record of the ACM Symposium on Principles of Programming Languages, Charleston, January 1993. ACM Press.

....paradigm look more complex than those in traditional functional programming, and we paid attention to the session of processes as abstraction in those interaction. In this context, several proposals for typed abstraction of the communication between processes, have been recently done, including [21, 24, 3, 19, 23, 26, 9, 27]. 21, 24] propose concurrency and interaction primitives and associated type notions to be incorporated into ML like functional programming languages[18] In another approach [22] a programming language and a typing system as an extension of (polyadic) calculus is proposed. This approach ....

....those in traditional functional programming, and we paid attention to the session of processes as abstraction in those interaction. In this context, several proposals for typed abstraction of the communication between processes, have been recently done, including [21, 24, 3, 19, 23, 26, 9, 27] [21, 24] propose concurrency and interaction primitives and associated type notions to be incorporated into ML like functional programming languages[18] In another approach [22] a programming language and a typing system as an extension of (polyadic) calculus is proposed. This approach tries to ....

[Article contains additional citation context not shown here]

A. Ohori and K. Kato, Semantics for Communication Primitives in a Polymorphic Language. In POPL'93, 1993.

....argument is known the properties of the target language ensure that the specialization will always terminate. We illustrate the use of intensional polymorphism by considering a flattening translation for tuples and a marshalling operation for distributed computing (based on Ohori and Kato [42]) This paper is organized as follows. In Section 2 we describe our approach to compilation as a type based translation from the source language, Mini ML, to the target language, ML i . The basic properties of ML i are stated, and a few illustrative examples are given. In Section 3 we give a ....

.... ) Wrap[ 1 ] Wrap[ 2 ] With this definition in mind, it is easy to check that wrap : 8t: Omega :T (t) T (Wrap[t] unwrap : 8t: Omega :T (Wrap[t] T (t) 5 Marshalling Ohori and Kato give an extension of ML with primitives for distributed computing in a hetrogenous environment [42]. Their extension has two essential features: One is a mechanism for generating globally unique names ( handles or capabilities ) that are used as proxies for functions provided by servers. The other is a method for representing arbitrary values in a form suitable for transmission through a ....

[Article contains additional citation context not shown here]

Atsushi Ohori and Kazuhiko Kato. Semantics for communication primitives in a polymorphic language. In Twentieth ACM Symposium on Principles of Programming Languages, pages 99--112, Charleston, SC, January 1993. Association for Computing Machinery.

....The former would be similar to our locations, the later, our resources. This discipline would open the possibility of typing code during in and out operations, rather than open. Several studies have addressed the issue of static typing for languages with remote resources; some recent papers are [20, 6, 22]. Perhaps the work closest to ours is that of Knabe [14] who has implemented an extension of Facile which supports mobile agents. The main extensions are remote signatures and proxy structures, which recall our location types. None of these works address open systems, however. On the other hand, ....

Atsuhi Ohori and Kazuhiko Kato. Semantics for communication primitives in a polymorphic language. In Conference Record of the ACM Symposium on Principles of Programming Languages, Charleston, January 1993. ACM Press.

....target object for method invocation resides in the same address space, the stub simply makes a procedure call to the method in the target local object. If the target object resides in a different address space, the stub performs an RPC. The systematic stub generation method presented in Reference [10] makes it 6 possible to pass the arguments of any statically typed data in the RPC. 3.2 Security Mechanism By combining the protection mechanism described in Section 3.1 and the wellknown cryptographic techniques, we designed a secure mobile object computing mechanism based on the wrap unwrap ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Proc. 20th ACM Symp. on Principles of Programming Languages, pages 99--112, Jan. 1993.

....far from straightforward. In the approaches to stub generation so far proposed, treatment of data types is rather ad hoc, and there seems to be no established method that deals uniformly with the various data types of programming languages, including higher order functions and pointers. Two of us [12] recently developed a transparent communication theory that can be used to eliminate the above mentioned type restriction in communication. The theory establishes a method of translating a statically typed polymorphic higherorder programming language with transparent communication capability into ....

....experimental results on the implementation of Distributed C. Section 6 describes related work. Section 7 concludes this paper. 2 Higher Order Remote Procedure Calls To make the present paper self contained, we include an overview of those parts of the techniques presented in a previous paper [12] that are relevant to the development of Distributed C. In particular, we describe only the algorithmic aspects of the techniques, and impose the restriction that a type must be monomorphic. The interested reader is referred to the above paper [12] for a full treatment of the polymorphic type ....

[Article contains additional citation context not shown here]

Ohori, A. and Kato, K.: Semantics for Communication Primitives in a Polymorphic Language, In Proc. 20th ACM Symp. on Principles of Programming Languages, Jan. 1993, pp. 99--112.

....user code. Reference [9] describes the technique in detail, including an eager sending scheme and a coherency maintenance scheme between the original and the sent copies. Reference [10] shows that the technique can be combined with another technique that can deal with higher order functions in RPC [16]. Security policies are dealt with in Planet in the following way. Planet inhibits objects in an ordinary protection domain from directly initiating the system calls of the operating system; all the system services must be requested to system service objects located in a protection domain that ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Proc. 20th ACM Symp. on Principles of Programming Languages, pages 99--112, Jan. 1993.

....previous sections and various naming policies can be implemented on top of Trap Do. The proxy generation technique used in Trap Do allows higher order functions to be passed among distinct heterogeneous address spaces. This stub generation technique is based on the one described in Ohori and Kato [17]. As described in Section 3.1, when passing a reference to an object to a remote address space, a certain depth of the transitive closure of the reference is transferred. The language preprocessor generates a traversal routine that creates this closure of the passed reference. By default, Trap DoC ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Proc. 20th ACM Symp. on Principles of Programming Languages, pages 99--112, January 1993.

....ease of understanding, we first describe the lazy portion of the method with caching, and then describe the eager portion. To concentrate our discussion on transparent treatment of remote pointers, we assume that the reader is familiar with conventional RPC stub generation techniques (See [3] and [14] for explanation of this technique) To simplify the explanation, we describe the case where a pointer that references data on the caller side is passed from the caller to the callee. Then we mention the general case where pointers are passed freely. We begin by introducing some notions. ....

....support a remote pointer to a function. This limitation might not be negligible, since passing a pointer that references a function to remote procedure is one of the strongest motivations for using remote pointers and performing callbacks in the conventional RPC programming style. Ohori and Kato [14] recently developed a systematic stub generation method that provides for the programmers the illusion that any polymorphic higher order functions can be passed among heterogeneous address spaces. Fortunately, their method and the method proposed in this paper do not conflict. Indeed, the authors ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Proc. 20th ACM Symp. on Principles of Programming Languages, pages 99--112, Jan. 1993.

....a pointer into an explicit invocation of a corresponding generic caller stub. Since f indicates a function locator that locates the function referenced by f, the generic caller stub uses f as a function locator. This translation algorithm is based on an algorithm presented by Ohori and Kato [32]. Their translation algorithm is powerful in the sense that it can handle polymorphic higher order functions. We use the monomorphic portion of their algorithm. 1: generic caller stub 2: int treeinttoint(functionlocatort locator, treet tree, int key) 3: same as the previous ....

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Proc. 20th ACM Symp. on Principles of Programming Languages, pages 99--112, January 1993.

No context found.

Atsushi Ohori and Kazuhiko Kato. Semantics for communication primitives in a polymorphic language. In Twentieth ACM Symposium on Principles of Programming Languages, pages 99--112, Charleston, SC, January 1993. Association for Computing Machinery.

No context found.

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Conference Record of the Twentieth Annual ACM SIGPLAN pages 99--112, Charleston, SC, January 1993.

No context found.

A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Conference Record of the Twentieth Annual ACM SIGPLAN pages 99--112, Charleston, SC, January 1993.

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