Luc Moreau. An Operational Semantics for a Parallel Functional Language with Continuations. In PARLE'92 Parallel Architectures and Languages Europe, volume 605 of Lecture Notes in Computer Science, pages 415--430, 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....language systems. The reason can be summarized as follows. ffl They are not suitable to discuss the control in sequential programming language. For instance, what part of code is to be moved on migration. Because the notion of control is ambiguous in concurrent calculi as pointed out in Refs. [52, 71, 79]. ffl The major difference in existing mobile language systems appears on the point of the way the heaps are modified on migration. Their mobile calculi, however, lack the notion of heaps. These problems are the very point we develop in the thesis work. Therefore, we think that our work ....

....and a novel optimization technique that reduces the size of the transmitted code on migration. It is difficult to carry out such analyses in the mobile calculi based on concurrent calculi [19, 82, 85] because the notion of control is ambiguous in concurrent calculi as pointed out in Refs. [52, 71, 79]. In the data aspect, we have proposed the notion of data movement protocols that describes any transparent data migration. The data movement protocols specify how a value in a heap is transmitted to a remote computer on migration. The notion of a heap does not appear in many mobile calculi ....

Luc Moreau. An Operational Semantics for a Parallel Functional Language with Continuations. In PARLE'92 Parallel Architectures and Languages Europe, volume 605 of Lecture Notes in Computer Science, pages 415--430, 1992.

....of the Facile programming language. An important fallout of this formalization effort is that it becomes mathematically feasible to prove the adequacy of the various translations considered here. Control operators and continuations in a parallel framework have already been considered, e.g. in [10, 17, 19]. The notion of barbed equivalence was presented in [16] for CCS and calculus. We have shown that this notion can be usefully applied to languages such as Facile and CML. The idea that asynchronous output is enough to simulate synchronous output in a variant of the calculus is presented in ....

L. Moreau. An operational semantics for a parallel functional language with continuations. In Proc. PARLE 92, 1992. SLNCS 605.

....is memorized as the last value for E. These continuations are symmetrically defined and the number of effective applications is 1 (nF Gamma 1) nE Gamma 1) where nF (resp. nE ) is the number of values returned by F (resp. E) This behavior is illustrated in figure 1 and detailed in [Que91, Mor92] some values for E a value for E another value for E a value for F symetrical for F No value for E and F a value for E and F apply F on all E keep it keep all E keep last E and F keep it apply last F on last E a value for F or a value for E Fig. 1. Continuation of a term of a pcall form The ....

Luc Moreau. An operational semantics for a parallel functional language with continuations. In D. Etiemble and J-C. Syre, editors, PARLE '92 -- Parallel Architectures and Languages Europe, pages 415--430, Paris (France), June 1992. Lecture Notes in Computer Science 605, Springer-Verlag.

....and e is memorized as the last value for E. These continuations are symmetrically defined and the number of effective applications is 1 (nF Gamma 1) nE Gamma 1) where nF (resp. nE ) is the number of values returned by F (resp. E) This behavior appears on figure 2 and is detailed in [Que91, Mor92] CD Scheme allows to program pcall with whatever semantics. The following example corresponds to the additive semantics. The definition is lengthy since semantics of continuation of pcall terms are complex. define macro (pcall . terms) let ( n (length terms) i 1) let ( handler ....

Luc Moreau. An operational semantics for a parallel functional language with continuations. In D. Etiemble and J-C. Syre, editors, PARLE '92 -- Parallel Architectures and Languages Europe, pages 415--430, Paris (France), June 1992. Lecture Notes in Computer Science 605, Springer-Verlag.

....to the value that would have been returned in normal style. Continuations come from the work of Strachey and Wadsworth [SW74, Rey93] and were used to denote control features such as goto i.e. unconditional jump. CPS and sophisticated control handling have always been sources of inspiration, see [DL92, SF92, Mor92, FSDF93, Sit93] for recent developments. Denotational techniques often drift into program transformations: CPS was exploited in Rabbit, the first Scheme compiler [Ste78] as a kind of intermediate language. CPS provides a simple (but not unique) Id: contlib.bk,v 1.27 1994 04 11 08:10:43 queinnec Exp . ....

Luc Moreau. An operational semantics for a parallel functional language with continuations. In D. Etiemble and J-C. Syre, editors, PARLE '92 -- Parallel Architectures and Languages Europe, pages 415--430, Paris (France), June 1992. Lecture Notes in Computer Science 605, Springer-Verlag.

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