J. Glauert, L. Leth, and B. Thomsen. A new process model for functions. In Sleep et. al., editor, Term Graph Rewriting: theory and practice. Wiley, 1992. Chpt. 18. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Translating Core Facile - Amadio (1995) (20 citations) (Correct)
....reformulated this idea in a higher order typed framework. The CPS translation discussed here is an extension of the one studied in [18] and revisited in a typed framework in [9] The translation of Facile into the calculus is inspired by [14] and by a variant of that translation considered in [8]. Finally the abstract machine studied here is similar in spirit, if not in the technical details, to those presented in [7, 13] 2 Reduction and Equivalence In this section we present the core Facile language, define its semantics, and illustrate its expressive power by some examples. 2.1 ....
....e : b de j e 0 e = dee j de 0 e Remarks. 1) The main differences w.r.t. Milner s translation of call by value calculus [14] are: i) the evaluation of the arguments proceeds sequentially, and (ii) variables are not stored but they are transmitted directly, an idea already presented in [8] which is quite useful in the translation of Facile input output operators. 2) There does not seem to be a direct translation of the C operator in F a , where direct means avoiding some form of CPS translation. However the spawn operator has a very simple translation as: dspawn eeu = deu j ....
J. Glauert, L. Leth, and B. Thomsen. A new process model for functions. In Sleep et. al., editor, Term Graph Rewriting: theory and practice. Wiley, 1992. Chpt. 18.
Process Semantics of Graph Reduction - Brock, Ostheimer (1995) (5 citations) (Correct)
....are coded as separate processes and in his concluding remarks Milner discusses that a more natural model would be to implement sharing. One of the aims of the work presented here was to solve this problem. We go further than Milner by relating the encodings to implementations. Glauert [6, 7] describes compatible encodings of lazy and eager evaluation in an asynchronous process notation. It is shown the process notation used can be translated into a graph reduction language. In Ostheimer and Davie [16] an encoding for shared reduction strategies was given in the (synchronous) monadic ....
J. Glauert, L. Leth, and B. Thomsen. A new process model for functions. In M. Sleep, M. Plasmeijer, and M. van Eekelen, editors, Term Graph Rewriting: Theory and Practice, chapter 20, pages 269--282. Wiley, 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