R. Gluck, V. F. Turchin. Application of metasystem transition to function inversion and transformation. In Proceedings of the Int. Symposium on Symbolic and Algebraic Computation (ISSAC'90), 286--287. ACM Press, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....quadratic string matching program into a KMPlike residual program. Such partial evaluators include Futamura s Generalized Partial Computation [26] Smith s partial evaluator for constraint logic programming languages [48] Queinnec and Ge#roy s intelligent backtracking [46] supercompilation [28, 29, 49, 50, 51], partial deduction [44] partial evaluators for functional logic programs [4, 40] and the composition of a memoizing interpreter and a standard partial evaluator [27] Like Similix, none of these partial evaluators has been proven correct and there are no guarantees about the resources required ....

Robert Gluck and Valentin F. Turchin. Application of metasystem transition to function inversion and transformation. In Proceedings of the international symposium on symbolic and algebraic computation, pages 286--287, Tokyo, Japan, August 1990. ACM, ACM Press. 34

....partial evaluation framework in order to pass the KMP test: Instead of making positive negative information explicit in the source program, one uses a specializer with the capability of collecting and using such information. For example Srensen et al. 21] observe that positive supercompilation [8, 9] maintains more information during the transformation process than does partial evaluation. More precisely, positive information is maintained; positive supercompilation of a naive string matcher and a pattern results in a linear matcher that may perform redundant tests. In contrast, Smith [20] ....

Robert Gluck and Valentin F. Turchin. Application of metasystem transition to function inversion and transformation. In Proceedings of the international symposium on symbolic and algebraic computation, pages 286--287, Tokyo, Japan, August 1990. ACM, ACM Press.

....Supercompilation [23] is a program transformation technique for functional languages 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 ....

.... is a classical problem in program transformation; for references see [19] Neither partial evaluation nor deforestation can achieve this transformation, as explained in [19] Partial deduction achieves the same effect in the logic programming context [4, 17] as driving in the functional setting [5]. This is not surprising given the close relation of driving and partial deduction [8] Here is one branch of the finite partial process tree: 1) case 2 (A; A; B] ss; A; A; B] ss) 2) if 3 (A; A; B] s 1 ; ss 1 ; A; A; B] s 1 : ss 1 ) 3) case 2 (A; B] ss 1 ; A; A; B] A : ss ....

R. Gluck, V.F. Turchin. Application of Metasystem Transition to Function Inversion and Transformation. ISSAC'90. 286-287, ACM Press 1990.

.... theorem proving, and program inversion has been discussed more thoroughly in the context of metacomputation [Tur80b, Tur82, Abr91, Rom91, Glu94] As one of the first examples of driving, it was shown that it is capable of inverting an algorithm for binary addition and perform binary subtraction [Tur72, Glu90]. Non termination patterns We will close the comparison by showing the correspondence of non termination patterns encountered in program specialization by driving and partial deduction. It should be obvious that the techniques for ensuring termination in partial deduction are closely related to ....

R. Gluck & V. F. Turchin. Application of Metasystem Transition to Function Inversion and Transformation. In Proceedings of the ISSAC '90 (Tokyo, Japan). 286-287, ACM Press 1990.

.... an application that has been suggested earlier in [80] Neighborhood analysis [84] uses driving to determine sets of data that pass through a computation process in 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, ....

....1972 by performing subtraction by inverse computation of binary addition [80] In 1973 S.A. Romanenko and later S.M. Abramov implemented an algorithm, Universal Resolving Algorithm (URA) in which driving was combined with a mechanical extraction of answers [1, 65] For program inversion see also [39, 41, 66, 93, 60]. In logic programming, one defines a predicate by a program P x y and solves the inversion problem for Z = True . Theorem proving and program transformation are indistinguishable in the approach outlined above; they are two applications of the same equivalence transformation. The definition ....

[Article contains additional citation context not shown here]

R. Gluck and V.F. Turchin. Application of metasystem transition to function inversion and transformation. In Proceedings of the ISSAC'90 (Tokyo, Japan), pp. 286--287. ACM Press, 1990.

.... the general matcher, but using only positive information, one gets the same program that P produces; applying Turchin s supercompiler unrestricted yields the desired optimal program (Gluck and Klimov, 1993) That a supercompiler can pass the KMP test on a similar general matcher was first shown in (Gluck and Turchin, 1990). We should note that supercompilation, as defined by Turchin, is a normal order transformation that is applied to applicative order programs and that transformed programs are again interpreted call by value. As a result, supercompilation may make programs terminate more often. On the other hand, ....

Gluck, R. and Turchin, V.F. 1990. Application of metasystem transition to function inversion and transformation. In Proceedings of the ISSAC'90, pages 286--287, ACM Press.

.... in [Glu93] using only positive information propagation to the tail recursive matcher, one gets the same program that W produces; applying the full driving mechanism of [Glu93] with both positive and negative information propagation yields the desired optimal program as shown in [Glu93] In [Glu90] Gluck and Turchin showed that Turchin s supercompiler could pass the KMP test with the nested general matcher. 5.3 GPC GPC extends partial evaluation as follows. Whenever a conditional (or something equivalent) testing whether predicate P holds is encountered during the transformation, P is ....

R. Gluck & V. F. Turchin. Application of Metasystem Transition to Function Inversion and Transformation. In Proceedings of the ISSAC '90. pp.286-287, ACM Press 1990.

.... generating extensions [17, 18] Refal and supercompilation: Turchin created the Refal language and developed the program transformation techniques of driving and supercompilation, which generalize partial evaluation [95, 96, 97] A number of recent surveys on driving and supercompilation exist [48, 89, 90, 91]. Prolog partial evaluation was pioneered by Komorowski [64, 65] subsequent work on Prolog includes [13, 44, 45, 66, 93, 98, 99] Sahlin constructed a practical but non self applicable partial evaluator for full Prolog [84, 85] Bondorf and Mogensen [76] constructed a self applicable partial ....

R. Gluck and V.F. Turchin. Application of metasystem transition to function inversion and transformation. In International Symposium on Symbolic and Algebraic Computation, ISSAC '90, Tokyo, Japan, pages 286-- 287. New York: ACM, 1990.

No context found.

R. Gluck, V. F. Turchin. Application of metasystem transition to function inversion and transformation. In Proceedings of the Int. Symposium on Symbolic and Algebraic Computation (ISSAC'90), 286--287. ACM Press, 1990.

....integrated; see also [4] However, the power of offline partial evaluation is limited by the approximations made during the binding time analysis; e.g. off line partial evaluation does not pass the KMP test. This led to the desire to self apply stronger, online methods such as supercompilation [10,17] and partial deduction [5,11] The idea of encoding expressions as data that can be manipulated as objects can be traced back to Godel who used natural numbers for representing expressions in a first order language as data (to prove the well known completeness and incompleteness theorems) Since ....

Robert Gluck and Valentin F. Turchin. Application of metasystem transition to function inversion and transformation. In Proceedings of the ISSAC '90 (Tokyo, Japan), pages 286--287. ACM Press, 1990.

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