N.D. Jones, "Partial Evaluation", Computing Surveys, Volume 28, No. 3 (September 1996)  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... In a sense, Problem Solving Methods have been the goal of computing for decades: we want to write generic programs, which contain all and only the essential features of the problem, and to specialize those generic programs to our particular context using some kind of partial evaluation [20] [19], some time after program construction time and before run time. Many published algorithms are written in a kind of pseudo code because we cannot yet write them generically [43] Part of the problem is that in general, we do not know all of the important context conditions that may affect the ....

N.D. Jones, "Partial Evaluation", Computing Surveys, Volume 28, No. 3 (September 1996)

....language processors as a language is defined. 4.4 Decision Times and Performance Finally, we want to make a point about performance issues, and claim that the flexibility of wrex need not cost too much. The basic idea is to compile out constant decisions using partial evaluation [31] 33] [32]. Here we rely on the fact that partial evaluation has much more information to use than is usually the case [50] 53] Decisions about program structure are made at many different times ffl Language Design time ffl Compiler Generation time ffl Program Generation time ffl Compile time ffl ....

N. D. Jones, "Partial Evaluation", Computing Surveys, Volume 28, No. 3 (September 1996)

....(sequential or parallel) Even though the main thrust of the paper is applicability of the above tool in the development of provably correct compilers, the tool has many other ap plications. For example, in the context of developing compilers through partial evaluation as proposed in Jones [14], termination is an important issue and the above tool can be used for proving termination. Rest of the paper is organized as follows. Next section provides an overview of the refinement algebra approach. Section 3 briefly describes various results on termination of logic programs and explains in ....

....the same lines and hence, would be applicable for compilers in GHC. We are currently working on the enhancement of the system to cater to various other aspects already mentioned and also the applicability of the tools in the context of developing compilers using partial evaluation as proposed in [14]. ....

N.D. Jones (1990), Partial Evaluation, Self-Application and Types, Proc. 17 th ICALP, Springer-Verlag LNCS 443, pp. 639-59.

....modules also make it very difficult to carry out static program analysis across the module boundaries. Because the module signature does not propagate any static information other than types, many existing techniques, such as constant propagation, function inlining [App92] partial evaluation [Jon91], and constraint based analysis [AH95] lose all their information at the functor application boundaries. In the previous example, if we textually inline all functor applications in the source, we can deduce that the f component in structure SC is equivalent to the following: fun f (x : int) ....

Neil D. Jones. Partial evaluation. POPL'91, tutorial handout, January 1991.

....modules also make it very difficult to carry out static program analysis across the module boundaries. Because the module signature does not propagate any static information other than types, many existing techniques, such as constant propagation, function inlining [2] partial evaluation [17], and constraint based analysis [1] lose all their information at the functor application boundaries. In the previous example, if we textually inline all functor applications in the source, we can deduce that the f component in structure SC is equivalent to the following: fun f (x : int) 3 ....

N. D. Jones. Partial evaluation. POPL'91, tutorial handout, January 1991.

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