N. D. Jones. Challenging problems in partial evaluation and mixed computation. In D. Bjrner, A. P. Ershov, N. D. Jones (eds.), Partial Evaluation and Mixed Computation, 1--14. North-Holland, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....as follows: fix f = fij pnq f (fix f) where pnq denotes the n th Church numeral. Such blind unfoldings are customary in most optimizing compilers and conventional partial evaluators. However, blind unfoldings were explicitly ruled out in partial evaluation and mixed computation, ten years ago [8], because not only do they most often lead to residual code explosion but also because they raise the thorny problem of finding a satisfactory n. We make do without them here, thus providing a concrete example of resource bounded partial evaluation [6] Acknowledgements Grateful thanks to Rowan ....

Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In Dines Bjrner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 1--14. NorthHolland,

....as follows. FUN (fn (INT x) INT (x 1) This residual program is cluttered with the type tags FUN and INT. 1. 2 The problem Obtaining a residual program without type tags by specializing an interpreter expressed in a typed language has been stated as an open problem for about ten years now [9, 10]. This problem has become acute with the advent of partial evaluators for typed languages, such as SML Mix [2] 2 A Sophisticated Solution: Type Specialization Recently, by shifting perspective and performing partial evaluation by nonstandard type inference instead of by non standard ....

Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In Dines Bjrner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 1--14. NorthHolland, 1988.

....or dynamic, which indicates code generation for the specialized program. Subsequently, a number of self applicable partial evaluators have been implemented, e.g. Similix [3] but most of them are for untyped languages. For typed languages, the so called type specialization problem arises [21]: Generating extensions produced using self application often retain a universal data type and the associated tagging untagging operations as a source of overhead. The universal data type is necessary for representing static values in the partial evaluator, just as it is necesssary for ....

Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In Dines Bjrner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 1--14. NorthHolland, 1988.

....evaluation technique. In addition, the current implementation su ers from some ineciencies because it is based on non deterministic type inference rules and performs a certain amount of backtracking. In return for this sophistication, HTS solve Jones s optimal type specialization problem (TSP) [14]: In a typed language, specialize a self interpreter with respect to a program so that the specialized program is a renaming of the original one. Such a self interpreter must encode the typed values of the language using a universal type. The challenge is to remove this encoding completely. ....

Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In Dines Bjrner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 1-14. North-Holland, 1987. Proceedings of the IFIP TC2 Workshop on Partial Evaluation and Mixed Computation.

....time suggests that residualization can be used as a full fledged partial evaluator for closed compiled programs, given their type. In the following section, we apply it to various examples that have been presented as typical or even significant achievements of partial evaluation, in the literature [15, 33, 36]. These examples include the power and the format source programs, and interpreters for Paulson s imperative language Tiny and for the calculus. The presentation of each example is structured as follows: ffl we consider interpreter like programs, i.e. programs where one argument determines a ....

Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In Partial Evaluation and Mixed Computation, pages 1--14. North-Holland, 1988.

....correctness of a compiler is guaranteed by the correctness of both the executable specification and our partial evaluator. The results reported in this paper improve on previous work in the domain of compiler generation [16, 30] and solves several open problems in the domain of partial evaluation [15]. In essence: ffl Our compilation goes beyond a mere syntax tosemantics mapping since the static semantics gets processed at compile time by partial evaluation. It is really a syntax to dynamic semantics mapping. ffl Because our partial evaluator is self applicable, a compiler is actually ....

....with by specializing the same executable specification. A stand alone compiler can be generated by self application with respect to the same executable specification. However, the partial evaluator needs to be sufficiently powerful. We have solved a series of open problems in partial evaluation [15]. Our partial evaluator specializes higher order Scheme programs [31] with an open ended set of algebraic operators and non flat binding time domains (i.e. partially static structures) Also, it can specialize itself and thus generate compilers automatically. Its source language has the block ....

N. D. Jones. Challenging problems in partial evaluation and mixed computation. In [12], pages 1--14.

....translator by the same method from an interpreter, using a partial evaluator for C [2] Hence, partial evaluation offers the development of a Scheme compiler for the price of writing two interpreters. The automatic conversion to tail form is also the first solution to Jones s 1987 challenge 11.5 [26]. The optimizing compiler performs aggressive constant propagation and higher order removal; it is a specializer in its own right. For its generation, we exploit two principles: the specializer projections for the generation of the transformer, and the language preservation property of offline ....

Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In Bjørner et al. [5], pages 1--14. Proceedings of the IFIP TC2 Workshop on Partial Evaluation and Mixed Computation.

No context found.

Jones, N. D. et al.: Challenging problems in partial evaluation and mixed computation. In: Bjrner, D., Ershov, A. P., and Jones, N. D. (eds.): Partial Evaluation and Mixed Computation: IFIP TC2 Workshop. North-Holland, Amsterdam, The Netherlands (1987) 1--14. Also pages 291--303 of [3]

....The binding time improver depends on the partial evaluators but not on the source programs. 3. Jones optimality is important for more than just building specializers that work well with the Futamura projections. Previously it was found only in the intuition that it would be a good property [17, 18]. The theorems give formal status to the term optimal in the name of that criterion. 4. The results also support the observation [25] that a specializer has a weakness if it cannot overcome inherited limits and that they are best observed through specializing a self interpreter (which amounts ....

N. D. Jones. Challenging problems in partial evaluation and mixed computation. In D. Bjrner, A. P. Ershov, N. D. Jones (eds.), Partial Evaluation and Mixed Computation, 1--14. North-Holland, 1988.

....of an self interpreter in a typed programming language. A self interpreter si is a term such that: si p e q e A typed self interpreter tsi is a term such that: tsi p e q w t e where w t is some type indexed embedding function. Now we can recap the definition of Jones optimality [5]. A partial evaluator PE is Jones optimal with respect to a an untyped self interpreter si when for all e : t we have PE(si; p e q ) e Again motivated by the role that a universal datatype plays in typed interpreters, we generalize the de nition of Jones optimality to the typed setting as ....

Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In D. Bjrner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 1-14, North-Holland, 1988. IFIP World Congress Proceedings, Elsevier Science Publishers B.V.

....an self interpreter in a typed programming language. A self interpreter si is a term such that: si p e q e A typed self interpreter tsi is a term such that: e : t = tsi p e q w t e where w t is a universal embedding function. Now we can recapitulate the definition of Jones optimality [5]. A partial evaluator PE is Jones optimal with respect to a an untyped self interpreter si when for all e : t we have PE(si; p e q ) e Again motivated by the role that a universal datatype plays in typed interpreters, we generalize the de nition of Jones optimality to the typed setting as ....

Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In D. Bjrner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 1-14, North-Holland, 1988. IFIP World Congress Proceedings, Elsevier Science Publishers B.V.

....of an self interpreter in a typed programming language. A self interpreter si is a term such that: si p e q e A typed self interpreter tsi is a term such that: tsi p e q w t e 12 where w t is some type indexed embedding function. Now we can recap the definition of Jones optimality [5]. A partial evaluator PE is Jones optimal with respect to a an untyped self interpreter si when for all e : t we have PE(si; p e q ) e Again motivated by the role that a universal datatype plays in typed interpreters, we generalize the de nition of Jones optimality to the typed setting as ....

Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In D. Bjrner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 1-14, North-Holland, 1988. IFIP World Congress Proceedings, Elsevier Science Publishers B.V.

No context found.

N. D. Jones. Challenging problems in partial evaluation and mixed computation. In D. Bjrner, A. P. Ershov, N. D. Jones (eds.), Partial Evaluation and Mixed Computation, 1--14. North-Holland, 1988.

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