R. Gluck and A. V. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In G. File, P.Cousot, M.Falaschi, and A. Rauzy, editors, Static Analysis. Proceedings, LNCS 724, pages 112--123. Springer-Verlag, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a practical partial evaluator for source programs is not feasible. Indeed, as the operational semantics gets more elaborated, the associated partial evaluation methods get al..so more and more complex. To overcome this problem, a promising approach successfully applied in other contexts (e.g. 11] [17], 28] is to consider programs written in an intermediate programming language with a simple operational semantics (and to automatically translate sourcelevel programs into this intermediate language) Recently, 21] introduced such a simplified representation for functional logic programs [7] ....

R. Gluck and A.V. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In Proc. of 3rd Int'l Workshop on Static Analysis (WSA'93), pages 112--123. Springer LNCS 724, 1993.

....supercompilation can perform program specialisation, language translation, theorem proving, and specialiser generation [TNT82] The deduction operation of a supercompiler is performed by driving. By driving, a term is unfolded and a tree of possible computations, called a process tree is produced [GK93] Driving is a constraint based information propagation technique; positive and negative information is passed during supercompilation by environments [Tur86] The generalisation step ensures termination of supercompilation by folding and generalising patterns in the process tree [Tur88] Recent ....

.... step ensures termination of supercompilation by folding and generalising patterns in the process tree [Tur88] Recent work in supercompilation includes experiments in self application of an implemented supercompiler [GT89, NPT96] the application of driving to first order functional languages [GK93] and 2.1 Program Specialisation by Partial Evaluation 15 continued research in metasystem transitions [Glu96, GK95, GS96] Supercompilation remains one of the first specialisation techniques to incorporate full constraint based information propagation. Positive Supercompilation Positive ....

[Article contains additional citation context not shown here]

R. Gluck and A. V. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In G. File, P.Cousot, M.Falaschi, and A. Rauzy, editors, Static Analysis. Proceedings, LNCS 724, pages 112--123. Springer-Verlag, 1993.

....of the SLD trees, nor can introduce disequalities. Thus, our de nition and folding rules which allow us to specialize programs w.r.t. disjunctions of conjunctions of goals, generalize conjunctive partial deduction. Supercompilation Supercompilation is a technique introduced and studied in [79, 147] for the semiautomatic improvement of programs by taking into consideration the various computation paths. However, those paths are considered in isolation and no relationship among them is exploited. Since our de nition and folding rules allow us to factorize common computations in di erent ....

R. Glck and A.V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil, and A. Rauzy, editors, 3rd International Workshop on Static Analysis, Padova, Italy, September 1993, Lecture Notes in Computer Science 724, pages 112123. Springer-Verlag, 1993.

....these techniques as program specialization techniques. Two discernible research directions in this area of program transformation can be seen in recent works. One direction focuses on uncovering the essence of the various automatic transformers. This was initiated largely by the Copenhagen team [GK93, SGJ94, NS95], and it has led to the formulation of transformers, such as partial evaluation, deforestation, and supercompilation, using a unifying framework that facilitates comparisons. Nielsen and Srensen [NS95] discuss enlightening points on the effects of evaluation orders, case rearranging rules, and CPS ....

....but the former is based on a call by value transformer, while the latter is based on a more powerful call by name transformer. Supercompilation, due to Turchin [Tur86] is even more general, as it can propagate additional information, usually termed as negative information, during transformation [GK93]. 7 Traditionally, partial evaluation has been applied largely to call by value languages. To preserve the language s semantics, these transformers should also use call by value transformation order. However, some work (e.g. Turchin s supercompiler) made use of call by name transformation order ....

R. Gluck and A. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In 3rd International Workshop on Static Analysis, number 724 in Lecture Notes on Computer Science, pages 112--123, Berlin, Germany, 1993. Springer-Verlag.

....achieve both the effect of deforestation and partial evaluation. Supercompilation is based on driving , a unification based transformation technique for functional languages. This makes supercompilation strictly stronger than partial evaluation and deforestation (for a detailed discussion see e.g. [GK93, SGJ94]) The generation of transformers from interpretive definitions provides an intriguing factorization of the problem of specifying, implementing and ensuring Supported by an Erwin Schrodinger Fellowship of the Austrian Science Foundation (FWF) under grant J0780 J0964. the correctness of ....

....substitutes all values directly into program expressions. Our solution (Fig. 5) is to introduce an environment ae and to use placeholders in program expressions in order to refer to values bound in the environment ae (placeholders correspond to configuration variables in [Tur86] see also [GK93]) All input values that will be dynamic at specialization time are bound to placeholders and all input values that will be static are substituted directly into program expressions, thus eliminating the need for a second environment. This provides the desired initial separation of static and ....

[Article contains additional citation context not shown here]

Robert Gluck and Andrei V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil`e, and G. Rauzy, editors, Static Analysis. Proceedings. Lecture Notes in Computer Science, Vol. 724, pages 112--123. Springer-Verlag, 1993.

....S Graph n and its meta programming concepts. The full language is given in [13] here we only need to consider a language fragment. The language seems well suited for our purposes. Among others, a subset of the language was successfully used for clarifying basic concepts of supercompilation, e.g. [1, 12]. 2.1 Syntax Figure 2 presents excerpts of S Graph n a first order, functional programming language restricted to tail recursion. A program is a list of function definitions where each function body is built from a few elements: conditionals IF, local bindings LET, function calls CALL, ....

R. Gluck and A.V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, et al., editors, Static Analysis. Proceedings. Lecture Notes in Computer Science, Vol. 724, pages 112--123. Springer-Verlag, 1993.

....infinite expressions) Folding then corresponds to transforming the infinite tree produced by T into a finite graph, by collapsing equivalent nodes. For deforestation, nodes 19 are considered equivalent if they are are equivalence up to variable renaming (so called identical folding in [9]) See for example Ferguson and Wadler s account of folding in deforestation [7] and related descriptions of folding for process trees in [9] Wadler originally argued that the expression level transformation is obviously correct (since it essentially uses just unfolding, and simplifications ....

....nodes. For deforestation, nodes 19 are considered equivalent if they are are equivalence up to variable renaming (so called identical folding in [9] See for example Ferguson and Wadler s account of folding in deforestation [7] and related descriptions of folding for process trees in [9]. Wadler originally argued that the expression level transformation is obviously correct (since it essentially uses just unfolding, and simplifications which eliminate constructors) But the property that the local steps are equivalence preserving, whilst necessary, does not in itself imply the ....

[Article contains additional citation context not shown here]

R. Gluck and A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In G.Fil`e P.Cousot, M.Falaschi and A.Rauzy, editors, Static Analysis. Proceedings, volume 724 of LNCS, pages 112--123. SpringerVerlag, 1993.

....the positive supercompiler to take negative information into account. A main contribution of the extension is to develop techniques which manipulate constraints of a rather general form. Similar techniques have not been presented in the literature, except for the paper by Gluck and Klimov [1] which, however, handles constraints of a simpler form; for instance, our algorithm for normalising constraints has no counterpart in their technique. As another main contribution we generalise a technique for ensuring that positive supercompilation always terminates to the perfect supercompiler ....

R. Gluck and A.V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, et. al., editors, Workshop on Static Analysis, volume 724 of LNCS, pages 112--123. Springer-Verlag, 1993.

....this negative information is maintained as a constraint when transforming t 0 . Consequently, Turchin s supercompiler can perform some optimisations beyond positive supercompilation. In this paper we present an algorithm which we call perfect supercompilation a term essentially adopted from [6] which is similar to Turchin s supercompiler. The perfect supercompiler arises by extending the positive supercompiler to take negative information into account. Thus, we retain the typical first order language as the language of programs to be transformed, and we adopt the style of ....

....constraints of a rather general form. Although running implementations of Turchin s supercompiler use such techniques to some extent, the techniques have not been presented in the literature for Turchin s supercompiler as far as we know. The only exception is the paper by Gluck and Klimov [6] which, however, handles constraints of a simpler form; for instance, our algorithm for normalising constraints has no counterpart in their technique. As another main contribution we generalise a technique for ensuring that positive supercompilation always terminates to the perfect supercompiler ....

R. Gluck and A.V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil`e, and G. Rauzy, editors, Workshop on Static Analysis, volume 724 of Lecture Notes in Computer Science, pages 112--123. Springer-Verlag, 1993.

....the presented framework. It should be noted that Romanenko s work is inspired by the concept of supercompilation introduced by Turchin [Tur86] in the 70s. Our method may be seen as an environment based special case of positive supercompilation, a term coined by Gluck, Jones, Klimov, and S rensen [GK93, SGJ94]. Supercompilation is a general mechanism to remove redundancy from programs by analyzing their execution histories and generating new programs by introducing suitable generalizations such that states recur. Positive supercompilation only propagates positive information through execution ....

Robert Gluck and Andrei V. Klimov. Occam 's razor in metacomputation: the notion of a perfect process tree. In Fil'e [Fil93], pages 112--123. LNCS 724.

....that is strictly stronger than partial evaluation and deforestation. It is capable of theorem proving and program inversion [20, 21, 22] and of program optimization beyond partial evaluation and deforestation [5] Recent renewed interest in supercompilation has lead to the positive supercompiler [6, 18, 19], a simplified version of Turchin s supercompiler for a functional language with trees as data structures. Supercompilation consists of driving and generalization, a technique to ensure termination of driving. A termination technique for the original supercompiler exists [24] The present paper ....

....program specialization based on constant propagation, such as conventional partial evaluation, and unification based methods, such as supercompilation and partial deduction, have quite different termination problems. The latter techniques are more aggressive, more perfect in the terminology of [6], so ensuring termination is harder. The authors have established a correspondence between driving and partial deduction [8] Indeed, our technique can be viewed as an instance of Martens and Gallagher s recent framework [14] for ensuring global termination of partial deduction. However, our ....

[Article contains additional citation context not shown here]

R. Gluck, A. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. P. Cousot et al. (eds.), Static Analysis. LNCS 724, 112123, Springer-Verlag 1993.

....evaluation in the context of functional languages usually relies on constant propagation, while transformation techniques for logic languages exploit unification based information propagation. The relation of specialization methods in functional languages has been studied to some extent, e.g. [Hol91, Glu93, Sor94c], but few attempts have been made to study the relationship of techniques used in logic and functional languages. Our goal was to establish a correspondence between two powerful methods used in the two programming paradigms, namely driving as used in supercompilation and partial deduction. ....

....the wheel, but also possibly generates new insights and developments, e.g. with respect to termination and generalization (abstraction) which are current research topics in both worlds. In the following we refer to Lloyd Shepherdson s partial deduction [Llo91, Kom92] and to positive driving [Glu93, Sor94c], a variant of Turchin s driving [Tur86] for a functional language with lists. Both transformation techniques developed independently, at different places and times. Komorowski introduced Supported by an Erwin Schrodinger Fellowship of the Austrian Science Foundation (FWF) under grant J0780 ....

[Article contains additional citation context not shown here]

R. Gluck & And. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In P. Cousot et al. (Eds.), Static Analysis, Proceedings. Lecture Notes in Computer Science, Vol. 724, 112-123, Springer-Verlag 1993.

....unfolding tree. Turchin s supercompiler [32, 14] can also do deforestation. Supercompilation performs driving (normal order unfolding and unification based information propagation) and generalisation (a form of abstraction) 33, 30] Tree structures are used to record the history of configurations [12]. The connection between driving and classical partial deduction was established in [13] Recently, a transformation scheme has been proposed for functional logic languages based on an automatic unfolding algorithm that builds narrowing trees [1] A generic algorithm is provided that does not ....

R. Gluck, A.V. Klimov. Occam's razor in metacomputation: The notion of a perfect process tree. In P. Cousot, et al. (eds.), Static Analysis. LNCS 724, 112--123, Springer-Verlag, 1993.

....more historical details, see Turchin s personal account [95] Despite these remarkable contributions, supercompilation has not found recognition outside a small circle of experts. This paper gives a gentle introduction to the principles of supercompilation in terms of a positive supercompiler [34, 73, 74, 75, 76] comprising two components, driving (Sect. 2) and generalization (Sect. 3) The supercompiler is compared to related program transformers (Sect. 4) and put into the larger perspective of metacomputation (Sect. 5) We give references to the literature throughout the text, which can hopefully be ....

.... identical ways; suggested for generalization [89] and program testing [2, 3] Several supercompilers have been developed for Refal [39, 49, 67, 89, 98, 99] including several experimental systems by the Refal group in Moscow (mostly unpublished, except [4] The first non Refal supercompiler was [34]. 4 Related Program Transformers In this section we compare positive supercompilation briefly to partial evaluation, deforestation, partial deduction, perfect supercompilation, and generalized partial computation. First we introduce a number of axes along which transformers can be compared, and ....

[Article contains additional citation context not shown here]

R. Gluck and A.V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil`e, and G. Rauzy, editors, Static Analysis. Proceedings., vol. 724 of LNCS, pp. 112--123. Springer-Verlag, 1993.

....and its relation to techniques used in other transformers, e.g. deforestation. The paper is based on (S rensen, Gluck and Jones, 1994) and (S rensen, 1994a) It belongs to a line of work which aims at a better understanding of supercompilation and its relation to other program transformers (Gluck and Klimov, 1993; Jones, 1994; Gluck and J rgensen, 1994; Gluck and S rensen, 1994; Nielsen and S rensen, 1995) The remainder of the paper is organized as follows. In Section 2 the object language is presented. In Section 3 we introduce the KMP test which allows us to assess the amount of information that a ....

....AAB (A : s3 : ss3) AAB (A : s3 : ss3) 3,4) if A = s3 then P[ loop B ss3 AAB (A : A : ss3 ) else P[ next AAB (A : s3 : ss3) 3,4,4,8) Fig. 14. Positive driving P[ match AAB ss0 ] continued (2) eliminate all unreachable branches in a program has perfect information propagation (Gluck and Klimov, 1993). A perfect version of driving that propagates positive and negative information is defined in the same work. While both positive and negative information arise from an equality test, only positive information arises from a case expression case v of p 1 t 1 ; pm t m . If there were a ....

[Article contains additional citation context not shown here]

Gluck, R. and Klimov, A.V. 1993. Occam's razor in metacomputation: the notion of a perfect process tree. In Static Analysis, Cousot, P., Falaschi, M., Fil`e, G., and Rauzy, A.(eds.), Lecture Notes in Computer Science, Vol.724, pages 112--123, Springer-Verlag.

....of information, and generalization: a form of abstraction which enables folding. The decision when to generalize is taken online. Recent work by Gluck and Klimov has expressed the essence of driving in the context of a more traditional tail recursive language manipulating Lisp like lists [Glu93]. Generalized partial computation (GPC) due to Futamura and Nogi [Fut88] and later applied to a lazy functional language [Tak91] has similar effects and power as supercompilation, but has not yet been implemented. The remainder of the paper is organized as follows. In Section 2 we introduce some ....

....an information propagating interpreter with respect to the tail recursive matcher and a fixed pattern [Glu94] 5.2 Supercompilation As mentioned, the mechanism ensuring the propagation of information in supercompilation is driving. Here we shall be concerned with driving as described in [Glu93] for a language with lists as data structures. Let us, for a moment, think of W as the generalization of a rewrite interpreter: when it unfolds a function call it replaces the call by the body of the called function and substitutes the actual arguments into the term being interpreted. ....

[Article contains additional citation context not shown here]

R. Gluck & And. Klimov.. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In Static Analysis, Proceedings. LNCS 724. pp.112-123, Springer-Verlag 1993.

....usually contain one or more unnecessary tests in the residual program; this is due to the lack of negative information in the transformation. Program transformation techniques that do propagate negative information during program specialisation include Turchin s perfect supercompilation [GK93] and Futamura s generalized partial computation [FN88] Supercompilation passes the structural information via environments, while, in generalized partial computation, information P is propagated through arbitrary predicates, and a powerful theorem prover is used to test P or :P when necessary. ....

R. Gluck and A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In G. Fil`e P.Cousot, M.Falaschi and A. Rauzy, editors, Static Analysis. Proceedings, volume 724 of Lecture Notes in Computer Science, pages 112--123. Springer-Verlag, 1993.

....of big step semantics derivations and its use of both inherited (downwards flowing) and synthesized (upwards flowing) attributes. However, the latter characteristics do not suit on line partial evaluation 1 algorithms that are oriented towards a term rewriting (small step) framework, e.g. [10, 12, 13, 20, 27, 28, 31, 33]. And simulations of two dimensional big step derivations by term rewriting on one dimensional representations destroy the beauty and many of the advantages of the big step framework [15, 23] In this paper, we develop an on line partial evaluator that lets a big step semantics be evaluated in ....

R. Gluck and A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In G. Fil`e P.Cousot, M.Falaschi and A. Rauzy, editors, Static Analysis. Proceedings, volume 724 of Lecture Notes in Computer Science, pages 112--123. Springer-Verlag, 1993.

....of the various predicates: mmatch(g; g; u) match(g; g; u) app(u; u; g) len(g; u) We do not provide here the proof of the soundness of M . The reader should notice that the derivation we will perform is more challenging than the ones usually presented in the literature (see, for instance, [7]) because it is a multi pattern specialization (not a single pattern) and also because in the initial program the occurrence of a pattern in the string is specified via list concatenation using the append predicate app. We want to specialize this multi pattern matching program w.r.t. the list ....

....rules also allow us to factorize common computations in different branches of the SLDNF trees. In a sense this factorization provides an extension of the basic supercompilation techniques, where the program improvements are achieved by taking into consideration single computation paths only [7, 19]. The use of the clause subsumption rule is motivated by the desire of increasing efficiency by avoiding redundant computations. Head generalizations are used for making equal the heads of several clauses and thus they allow us to perform folding steps. The case split rule is the crucial rule for ....

R. Gluck, A.V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. Proc. WSA '93, Padova, Italy, LNCS 724, 112--123. Springer Verlag, 1993.

....further research. Turchin s supercompiler does not just propagate positive information (by applying unifiers) but also propagates negative information which can restrict the values that the variables can take by using environments of positive and negative bindings (bindings which do not hold) GK93, LG97a, SGJ94, Tur86] We think that we can strengthen this effect in the setting of (equational) constraint logic programming [AFL95, JL87] by using some kind of narrowing procedure with disunification, such as the ones defined in Arenas et al. AGL94] Bert and Echahed [BE95] Fern andez ....

R. Gluck and A.V. Klimov. Occam's razor in metacomputation: The notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil`e, and A. Rauzy, editors, Proceedings of the 3rd International Workshop on Static Analysis, WSA'93, volume 724 of Lecture Notes in Computer Science, pages 112--123, Berlin, 1993. Springer-Verlag.

....deduction does not pass the strong KMP test. This limitation also applies to the automatic derivations based on partial evaluation techniques [9] of specialized KMP matching programs both in functional and logic languages, which have been published in the literature. Also Gluck and Klimov in [8], who apply the supercompilation technique, consider an initial program which is similar to the one presented in Figure 2(A) The inability of standard partial deduction to pass the strong KMP test is due to the following facts: standard partial deduction may fail to propagate information ....

....to the body. Moreover, in [16] there is an example where it is shown that exponential improvements are possible and there is a fully automatic derivation of a specialized version of a multi pattern matching program. A transformation technique which is closely related to ours is supercompilation [8, 26]. Also by this technique it is possible to achieve program specialization and the elimination of intermediate data structures. One major difference with our work is that supercompilation basically deals with functional programs which are deterministic. Now we want to make some final remarks ....

R. Gluck and A.V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil'e, and A. Rauzy, editors, 3rd International Workshop on Static Analysis, Padova, Italy, September 1993, Lecture Notes in Computer Science 724, pages 112--123. Springer-Verlag, 1993.

....Positive driving, a variant of driving developed by Gluck and S rensen, has been shown to be equivalent to partial deduction in logic languages. The Simple Functional Language M In order to discuss representing functional computations precisely, we will employ a simple functional language M [GK93, SGJ94, GS94, SG95b]. Definition5. Language M d : f v 1 : vn t j g p 1 v 1 : v n t 1 . g pm v 1 : vn t m t : b j f b 1 : b n j g t b 1 : b n j if b 1 = b 2 then t 1 else t 2 b : v j c b 1 : b n p : c v 1 : vn The following restrictions exist for this language: ....

Robert Gluck and Andrei V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In G. Fil`e P.Cousot, M.Falaschi and A. Rauzy, editors, Static Analysis. Proceedings, pages 112--123, Springer-Verlag, 1993.

....methods [Tur86] applied to a non strict language 4 can be described very naturally in terms of Scherlis expression procedure transformations. Turchin describes transformations of REFAL (a first order functional language) via the construction of a process graph (in the terminology of [GK93]) The aim is to construct a finite graph by folding equivalent nodes, according to some folding strategy (for example, syntactic equivalence modulo renaming) and finally to re interpret the graph as a program. Expression procedures are a good fit for describing this style of transformation. The ....

R. Gluck and A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In G.Fil`e P.Cousot, M.Falaschi and A.Rauzy, editors, Static Analysis. Proceedings, volume 724 of LNCS, pages 112--123. Springer-Verlag, 1993.

....and tupling. It is based on unification based information propagation and normal order reduction. Supercompilation performs driving (unfolding and information propagation) and generalisation (a form of abstraction) 28] Tree structures are used to record the history of configurations [9]. The connection between driving and classical partial deduction was established in [10] See also [25,16] Deforestation, as described in [29] can remove some intermediate data structures. It has been defined for treeless terms , but lacks sufficiently sophisticated local and global control to ....

R. Gluck and A.V. Klimov. Occam's razor in metacomputation: The notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil'e, and G. Rauzy, editors, Proceedings SAS'93, pages 112--123. Springer-Verlag, LNCS 724, 1993.

No context found.

Glck R., Klimov A. V., Occam's razor in metacomputation: the notion of a perfect process tree. In: Cousot P., Falaschi M., Fil G., Rauzy A. (eds.), Static Analysis. Proceedings. (Padova, Italy). Lecture Notes in Computer Science, Vol. 724, 112-123, Springer-Verlag 1993.

....[4] is that to do this, it su#ces, in principle, to stage an inverse interpreter: via the Futamura projections this will give an inverse compiler. This is convenient because inverse computation is simpler than program inversion. The second key idea is to use the notion of a perfect process tree [12] to systematically trace The Universal Resolving Algorithm 189 the space of possible execution paths by standard computation, in order to find the inverse computation. The Universal Resolving Algorithm (URA) introduced in this paper is sound and complete, and computes each solution, if it ....

....f # Fname z # Symb e # Pexp ea # PAexp x # Pvar xe # PEvar xa # PAvar Fig. 4. Abstract syntax of typed S Graph (TSG) 3 Source Language We consider the following first order functional language, called TSG, as our source language. The language is a typed dialect of S Graph [12]. The syntax of TSG is given by the grammar in Fig. 4; the operational semantics is defined in Fig. 5. An example program in concrete syntax is shown in Fig. 13. This family of languages has been used earlier for work on program transformation [2, 11, 12] Syntax. A TSG program is a sequence of ....

[Article contains additional citation context not shown here]

R. Gluck, A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot et al. (eds.), Static Analysis. Proceedings, LNCS 724, 112--123. Springer-Verlag, 1993.

....5.10 Pattern Matcher (matchaab) Source program matchaab(x) is a non linear pattern matcher that check if there is pattern [a, a, b] in a given text x. The residual program is a KMP type linear pattern matcher. Note that the pattern matcher used here in the source program is as naive as the one in [7, 18, 28], but more naive than the one used in [8] matchaab(x) # f ( a, a, b] x, a, a, b] x) f(p, t, p 0 , t 0 ) # if Null(p) then true else if Null(t) then false else if car(p) car(t) then f(cdr(p) cdr(t) p 0 , t 0 ) else if Null(t 0 ) then false else f(p 0 , cdr(t 0 ) p 0 , cdr(t 0 ....

Gluck, R., Klimov, A.V.: Occam's razor in metacomputation: the notion of a perfect process tree. In: Cousot, P., et al. (eds.): Static Analysis. Lecture Notes in Comp. Science 724 Springer-Verlag (1993) 112--123.

....hierarchy is any situation where a program p 0 is manipulating (e.g. interpreting, compiling, transforming) another program p 1 . Program p 1 may be manipulating another program p 2 , and so on. A metasystem hierarchy can be diagrammed using an Metasystem Transition (MST) scheme as in Figure 1 [7,9,27]. The best known examples are the Futamura projections which were the driving force behind the initial work on self application of program specialization systems. This work identified binding time analysis as a useful tool for attacking the fundamental problem of tracking unknown values, and ....

....stronger forms of online specialization such as supercompilation. Outline In this paper, we report on the initial design and partial implementation of such a system. The system is based on S Graph a very simple language which has been used to study the foundations of supercompilation [9] and neighborhood analysis [1] Section 2 revisits the syntax and semantics of S Graph. Section 3 discusses problems of program encodings. Based on this discussion, Section 4 presents a new version of S Graph called S Graph n which contains language primitives especially designed for manipulating ....

Robert Gluck and Andrei V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. Fil`e, and G. Rauzy, editors, Static Analysis. Proceedings. Lecture Notes in Computer Science, Vol. 724, pages 112--123. Springer-Verlag, 1993.

No context found.

R. Gluck and A. V. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In G. File, P.Cousot, M.Falaschi, and A. Rauzy, editors, Static Analysis. Proceedings, LNCS 724, pages 112--123. Springer-Verlag, 1993.

No context found.

R. Gluck and A.V. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In Proc. of WSA'93, pages 112--123. Springer LNCS 724, 1993.

No context found.

) Gluck R. and Klimov A., "Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree," in Proc. of the 3rd Int'l Workshop on Static Analysis, Springer LNCS 724, pp. 112--123, 1993.

No context found.

R. Gluck and A.V. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In P. Cousot, M. Falaschi, G. File, and A. Rauzy, editors, Proc. of 3rd Int'l Workshop on Static Analysis, WSA'93, pages 112--123. Springer LNCS 724, 1993.

No context found.

R. Gluck and A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. File, and A. Rauzy, editors, Static Analysis. Proceedings, LNCS 724, pages 112--123. Springer-Verlag, 1993.

No context found.

) Glfick, R. and Klimov, A. V., "Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree," in Static Analysis, Lecture Notes in Computer Science 724 (Cousot, P., et al. eds.), Springer-Verlag, pp. 112-123, 1993.

No context found.

R. Gluck and And. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot et al., editors. Static Analysis. Proceedings. LNCS, Vol. 724, 112--123 (Springer-Verlag, 1993).

No context found.

Gluck, R. and Klimov, And., Occam's razor in metacomputation: the notion of a perfect process tree. In: Static Analysis, COusot et.al (Eds), LNCS Vol 724, pp.112-123, Springer-Verlag 1993.

No context found.

R. Gluck and A. V. Klimov, "Occam's razor in metacomputation: the notion of a perfect process tree," in Static Analysis. Proceedings (P. Cousot, M. Falaschi, G. File, and A. Rauzy, eds.), vol. 724 of Lecture Notes in Computer Science, pp. 112-123, Springer-Verlag, 1993. [DART-177].

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