Johnsson, T. (1984). E#cient compilation of lazy evaluation. Sigplan notices, 19(6), 58--69.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....that process temporally sensitive information. 3.1 DPM: Data Pull Model The control part of Pspectra is based on the DPM [Bos99] Within this model, the execution is driven by the sink which requests data as it is needed. the DPM is implemented according to a lazy evaluation approach [Joh84] Lazy evaluation (call by need) has been proposed as a method for executing functional programs. The advantages of this are, among others, that unbounded data structures, e.g. in nite lists, can be handled easily, and furthermore it makes interactive input output possible in functional programs. ....

T. Johnsson. Ecient compilation of lazy evaluation. SIGPLAN Notices, 19(6):5869, June 1984.

....one, then the system can provide hard real time constraints. 3.1 DPM: Data Pull Model Before looking into the Data Reactive Model (DRM) let us account for the Data Pull Model (DPM) on which the control part of Pspectra is based. The DPM is implemented according to a lazy evaluation approach [7]. Lazy evaluation (call by need) has been proposed as a method for executing functional programs. The advantages of using the DPM in Pspectra include: improved computational e#ciency resulting from the ability of lazy evaluation, rapid response to changes in the processing requirements, and the ....

T. Johnsson. E#cient compilation of lazy evaluation. SIGPLAN Notices, 19(6):58--69, June 1984.

....of imperative programs in spite of the use of graph reduction. In the 1980s typed versions of lazy functional languages did emerge, as well as a considerable speed up of their performance. A lazy version of ML, called Lazy ML (LML) was implemented e#ciently by a group at Chalmers University, see [66]. As underlying computational model they used the so called G machine, that avoids building graphs whenever e#cient. For example, if an expression is purely arithmetical (this can be seen from type information) then the evaluation can be done more e#ciently than by using graphs. Another ....

T. Johnsson, E#cient compilation of lazy evaluation, SIGPLAN Notices, vol. 19 (1984), no. 6, pp. 58--69.

....SML, multiple argument functions generally take a tuple) 2. As curried functions are used commonly in many functional programming languages, the implementations of some graph reduction machines have attempted to make curried functions as e cient as possible. In the STG Machine and the G Machine ([2, 7]) curried functions are compiled assuming all their arguments are on the stack. The application of arguments to a curried function, f x y, is implemented by pushing x and y on a stack and jumping to the function f. But what happens if a function does not have enough arguments (i.e. it is not ....

Thomas Johnsson. Ecient compilation of lazy evaluation. In Proceedings of the SIGPLAN '84 Symposium on Compiler Construction, pages 5869. ACM, ACM, 1984. Available as SIGPLAN Notices 19(6) June 1984.

....computers. Also observe that the compilers presented here detect all non sequential matchings and can thus react appropriately when given such a matching as input. An appropriate reaction is usually to issue a warning message before producing a non correct automaton. Published language de nitions [Johnsson 1984; Hudak, P. and Peyton Jones, S. L. and Wadler, P. 1992] present a di erent semantics for pattern matching: they select one particular sequential semantics (i.e. left to right) This approach lacks the generality and elegance of Laville s solution. First, there is no natural correspondence ....

Johnsson, T. 1984. EÆcient compilation for lazy evaluation. SIGPLAN Notices 19, 6 (June), 58-69.

No context found.

Johnsson, T. (1984). E#cient compilation of lazy evaluation. Sigplan notices, 19(6), 58--69.

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