J.H. Reppy: Concurrent ML: Design, Application and Semantics. Proc. Functional Programming, Concurrency, Simulation and Automated Reasoning. Springer Lecture Notes in Computer Science 693, pages 165--198, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....this leads to hybrid calculi that contain the syntax of a process algebra as well as that of the calculus, e.g. 7, 17] Putting more emphasis on the functional features, another approach is to extend a realistic functional language with primitives for communication. Good examples include CML [16, 24, 25, 26], Facile [10] and LCS [2] but also Concurrent Clean [22] may be viewed in this way. We refer to [12] for a much more detailed survey of some of these issues. We follow the latter approach and base ourselves on Reppy s language CML. It is an extension of Standard ML with primitives for ....

....communication behaviours. This is in line with the ideas of [17] but we deviate from [17] in separating the type and communication information by using the notion of effect system previously developed for functional languages, e.g. 13, 28] Section 2 gives a presentation of this system. Both [25, 26] and [1] give a structural operational semantics for CML. As is usual the types do not influence the semantics but for the purpose of proofs it may be desirable to label the transition relation with additional book keeping details (and to retain some type information in the expressions) The main ....

[Article contains additional citation context not shown here]

J.H. Reppy: Concurrent ML: Design, Application and Semantics. Proc. Functional Programming, Concurrency, Simulation and Automated Reasoning. Springer Lecture Notes in Computer Science 693, pages 165--198, 1993.

....We prove the soundness of the inference system and the two analyses and demonstrate how to implement them; the latter amounts to transforming the syntax directed inference problems to instances of syntax free equation solving problems. 1 Introduction Higher order concurrent languages as CML [15] and FACILE [4] offer primitives for the dynamic creation of processes and channels. A distributed implementation of these languages immediately raises the problem of processor allocation. The efficiency of the implementation will depend upon how well the network configuration matches the ....

....means of loop d. The primitive choose allows to perform an unspecified choice between the two communication possibilities and wrap allows to modify a communication by postprocessing the value received or transmitted. The sync primitive enforces synchronisation at the right points and we refer to [15] for a discussion of the language design issues involved in this; once we have arrived at the process algebra such considerations will be of little importance to us. Next consider the function pipe itself. Here fs is the list of functions to be applied, in is the input channel, and out is the ....

J.R.Reppy: Concurrent ML: Design, Application and Semantics. Springer Lecture Notes in Computer Science 693, pp. 165--198, 1993.

....We prove the soundness of the inference system and the two analyses and demonstrate how to implement them; the latter amounts to transforming the syntax directed inference problems to instances of syntax free equation solving problems. 1 Introduction Higher order concurrent languages as CML [16] and FACILE [5] offer primitives for the dynamic creation of processes and channels. A distributed implementation of these languages immediately raises the problem of processor allocation. The efficiency of the implementation will depend upon how well the network configuration matches the ....

....means of loop d. The primitive choose allows to perform an unspecified choice between the two communication possibilities and wrap allows to modify a communication by postprocessing the value received or transmitted. The sync primitive enforces synchronisation at the right points and we refer to [16] for a discussion of the language design issues involved in this; once we have arrived at the process algebra such considerations will be of little importance to us. The overall construction of the network of processes is then the task of the pipe function defined by rec pipe fs = fn in = fn ....

J.R.Reppy: Concurrent ML: Design, Application and Semantics. Springer Lecture Notes in Computer Science 693, pp. 165--198, 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