Gluck, R. Towards multiple self-application. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press, pp. 309--320, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....which computes the inner product v Deltaw of two vectors v, w of dimension n (Figure 2) Depending on the availability of the input, the computation of the inner product can be performed in one, two, and three stages. The residual program obtained by specializing iprod wrt two inputs n=3 and v=[7 8 9] is shown in Figure 3. A call of the form (ref i v) returns the i th element of vector v. Figure 4 shows a three level version of the inner product where the arguments of iprod have the following binding times: n:0, v:1, and w:2. The program is annotated using a concrete multi level syntax of ....

....( The general format of dynamic operations is 4 (define (iprod n v w) if ( n 0) ref n v) ref n w) iprod ( n 1) v w) 0) Fig. 2. Source program. define (iprod nv w) 9 (ref 3 w) 8 (ref 2 w) 7 (ref 1 w) 0) Fig. 3. Residual program (n=3, v=[7 8 9]) define (iprod3 n v w) if ( n 0) 2 ( 2 ( lift 1 1 ( ref 1 (lift 1 n) v) ref 2 (lift 2 n) w) iprod3 ( n 1) v w) lift 2 0) Fig. 4. A multi level program. define ( op t . es) if ( t 1) op . es) QUOTE ,op) t 1) es) define (lift s e) if ( ....

[Article contains additional citation context not shown here]

R. Gluck. Towards multiple self-application. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 309--320, ACM Press 1991.

....from arbitrary programs. For this purpose we generalized partial evaluation techniques, such as binding time analysis, specialization points, memoization, and code generation (Sect. 4 and 5) This novel multi cogen approach solves two fundamental problems of self applicable partial evaluation [Glu91]: the generation time problem and the generator size problem. The multi level generator gives an impressive reduction of generation time and code size compared to multiple self application (Sect. 6.1) Supported by an Erwin Schrodinger Fellowship of the Austrian Science Foundation (FWF) under ....

....2.3 How to Generate Multi Level Generating Extensions Assume that we have only the conventional specialization tools: a self applicable specializer spec and a compiler generator cogen. Then we know of two methods that can, in principle, be used to generate a multi level generating extension [Glu91]: incremental self application and multiple self application. Consider a three staged program, namely a meta interpreter mint, that takes a language definition def, a program pgm and its data dat as input. Let def be written in the definition language D, let pgm be written in language P (defined ....

[Article contains additional citation context not shown here]

Robert Gluck. Towards multiple self-application. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 309--320, New Haven, Connecticut, 1991. ACM Press.

....step from a program to the application of a metaprogram to the encoded form of the program is a metasystem transition; repeated use of metasystem transition leads to a multi level metasystem hierarchy. In the remainder of this paper we adopt the language independent formalization of [30] based on [27, 35, 84, 97]. Metasystem transition is a key ingredient of Turchin s approach: the construction of hierarchies of metasystems (e.g. supercompilers) was taken as the basis for program analysis and transformation [83] The book [96] defined all three Futamura projections in terms of metasystem transition. ....

....we now consider the use of multi level metasystem hierarchies together with a supercompiler. During the construction of multi level hierarchies, we will frequently need to replace metacoded subexpressions by metavariables. The correct treatment of metacode is so essential in self application [27], that we make elevated metavariables [97] an integral part of the MST language. We define a metasystem transition language C by the grammar C : D j M IN j C C where M IN is a set of elevated metavariables m H ; H 2 IN . An elevated metavariable m H ranges over data metacoded H times. ....

[Article contains additional citation context not shown here]

R. Gluck. Towards multiple self-application. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 309--320. ACM Press, 1991.

....order in 1 , inn . There exists basically two main approaches to achieve incremental partial evaluation [13] These approaches extend the concept of generating extensions to multi level specialization. 2. 1 Multi Level Generating Extension The idea of multi level offline specialization [11, 13] can be described as follows. An n level generating extension is a program that produces (n Gamma1) level generating extensions. The base case is a two level generating extension, which corresponds to the classic definition of p gen given above. An n level generating extension p mgen n for ....

....n However, defining an mcogen is not a trivial task [13] 2. 3 Iterated Two Level Specialization Instead of specifically developing a multi level bindingtime analysis and a multi level compiler generator mcogen, we consider an alternative construction called incremental self application [11, 12] or incremental generation [13] To first get some intuition, consider again the loop nest case, given only a two level generating extension. for i = for j = fres = fgen(i,j) for k = fres(k) end end end To further factorize computations depending only on i inside the j loop, the ....

R. Gluck. Towards multiple self-application. In Partial Evaluation and Semantics-Based Program Manipulation, pages 309--320, New Haven, CT, USA, September 1991. ACM SIGPLAN Notices, 26(9).

.... values to be placed in data structures and closures, and to provide unknown values with known attributes such as types or arithmetic signs [45, 16] Online specializers use a variety of mechanisms to cause the building of specializations: some are based on explicit reduce residualize annotations [20], others on a metalanguage [10] and still others on various forms of recursion detection [45, 43] The meta language approach allows the user to define a fold here predicate for each function, which is passed the function s arguments and decides whether or not to unfold it. The recursion ....

....that makes the same reduce residualize choices as an offline specializer would by simply running a binding time analysis in parallel with the specializer. This approach would construct the directions for reduce residualize at specialization time, then obey them. One such a system, described in [20], performs BTA (called configu7 ration analysis in [20] on the fly before specializing each function. This analysis could have been performed statically by a polyvariant BTA; performing it dynamically achieves similar polyvariance with a simple analysis. We would expect that such systems would ....

[Article contains additional citation context not shown here]

R. Gluck. Towards multiple self-application. In Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut. (Sigplan Notices, vol. 26, no. 9, September 1991), pages 309--320. ACM, 1991.

....n Gamma h times, but the 2 This notation was first used by one of the present authors (VT) in lectures at the University of Copenhagen in 1985. Ever since, its various versions were used in seminars on Refal and metacomputation in Moscow and New York. In a published form it first appeared in [5]. possible values of this variable are only such that they an object expression h times. In particular, if an input variable is of an elevation h, its desired value must be metacoded h times before the beginning of computation. See more about elevated variables in [15] Moving variables up ....

Gluck, R., Towards multiple self-application, Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation (Yale University), ACM Press, 1991, pp.309-320.

....[13] 4 Examples of Use of the Metasystem Transitions A metasystem is a program that examines, controls and manipulates other program as an object. A metasystem transition is a transition from a program S to a metasystem S 0 which incorporates the original program as object [17] 20] 21] [7]. In [21] V.F. Turchin presented a method to improve the transformational power of supercompilation without modifying the transformation system. The main idea is to insert an interpreter between the object program and the transformation system. By hand, he gave a number of exapmles to demonstrate ....

Gluck R. , Towards multiple self-application. In: Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp.309-320, New Haven, Connecticut, ACM Press, 1991.

No context found.

Gluck, R. Towards multiple self-application. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press, pp. 309--320, 1991.

....non trivial self applicable specializers incorporate a selfinterpreter for evaluating static expressions, the run time of multiple selfapplication typically grows exponentially with the number of self application levels. These problems can dramatically impact usability, e.g. of self application [6,8]. Various approaches have been employed to improve the performance and the manipulation of representations. For instance, the logic programming language Godel [13] provides built in metaprogramming facilities for two level hierarchies. f(IF cntr tree1 tree2)g = CONS (ATOM IF) CONS fcntrg ....

....influenced by three concepts present in Turchin s work [22,23] metacoding, metavariables, and metasystem transition. Subsequently, these concepts have been formalized [7] and studied in different contexts, e.g. 25] The correct treatment of metacode was found essential in self application [6] and this concept was singled out as elevation index [27] The problem of self application was the driving force behind the work on partial evaluation in the early eighties. The offline approach was originally introduced to avoid the generation of overly general compilers by self application of ....

[Article contains additional citation context not shown here]

Robert Gluck. Towards multiple self-application. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 309--320, New Haven, Connecticut, 1991. ACM Press.

No context found.

R. Gluck. Towards multiple self-application. In Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut. (Sigplan Notices, vol. 26, no. 9, September 1991.

No context found.

Robert Gluck. Towards Multiple Self-Application. In ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation. 1991.

No context found.

R. Gluck. Towards multiple self-application. In Hudak and Jones [62], pages 309--320.

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