V.F. Turchin. Equivalent Transformations of Recursive Functions Defined in Refal. Teorija Jazykov i Metody Programmirovanija (Proceedings of the Symposium on the Theory of Languages and Programming Methods). (Kiev-Alushta, USSR). 31-42, 1972 (in Russian).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....e.g. partial deduction [12, 11, 4] partial evaluation [9] and deforestation [26] 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 ....

V.F. Turchin. Equivalent Transformations of Recursive Functions Defined in Refal. Teorija Jazykov i Metody Programmirovanija (Proceedings of the Symposium on the Theory of Languages and Programming Methods). (Kiev-Alushta, USSR). 31-42, 1972 (in Russian).

....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. Although it has been observed that supercompilation is capable of theorem proving and program inversion [Tur72, Tur80b, Tur82], an in depth comparison was not done. Such a comparison is useful, because it not only prevents reinventing 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 ....

.... After several years of neglect the importance was realized and there is now growing interest in this area, e.g. Kom92] The main theoretical results for partial deduction were developed by Lloyd and Shepherdson [Llo91] Driving was conceived in the early seventies by Turchin in the former USSR [Tur72] and developed into a comprehensive methodology summarized as supercompilation [Tur80a, Tur86] It strictly contains partial evaluation as well as Wadler s more recent invention deforestation [Wad90] but driving and supercompilation have taken longer to be recognized in the context of program ....

[Article contains additional citation context not shown here]

V. F. Turchin. Equivalent Transformations of Recursive Functions Defined in Refal. In Teorija Jazykov i Metody Programmirovanija (Proceedings of the Symposium on the Theory of Languages and Programming Methods). (KievAlushta, USSR). 31-42, 1972 (in Russian).

....[Bec75] They were aware of the Lombardi Raphael work as well as Futamura s paper. They also considered the possibility of compiler generator generation, but had not attempted self application in practice. As mentioned, Turchin in Moscow had formulated the transformation rules for driving in 1972 [Tur72,Tur74]. The main results of the theory of compilation were formulated in 1973. Due to political circumstances, Turchin was dismissed from his job from 1974 and his results were not published at this point. Ershov in Novosibirsk, USSR, discovered around 1976 the first Futamura projection independently, ....

....is explicitly denied, see the quotation to Chapter 3. Section 3.4 suggests that the two views are in fact complementary. Of course, the correctness of Turchin s supercompilation ultimately relies on the correctness of certain transformations on terms. These transformations were first stated in [Tur72] and have, as far as the author knows, only appeared in English in [Tur80a] Chapter 3. They comprise 5 algorithmic equivalences, concerning manipulation of the program, i.e. reversing the order of clauses, deleting clauses etc. and 2 functional equivalences, concerning transformation of programs, ....

V. F. Turchin. Equivalent Transformation of Recursive Functions Defined in the Language REFAL (in Russian). In Trudy Vsesoyuzn. Simpos Teoria Yazykov i Metody Progr. pages 31-42, Alushta-Kiev, 1972.

....methods for graph development: driving and folding . Driving . This is a general method for constructing a (potentially infinite) process tree (a process graph that happens to be a tree) by step wise exploring all possible computations of a program p starting from an initial configuration ci [20,22,24]. At any point during driving one has a perhaps incomplete process tree and a way to extend the process tree by adding a new node. Driving follows all possible computation processes starting from an initial configuration ci and continues until every leaf of the process tree represents only ....

....(IF (CONS stail 4 shead 5 stail 6) IF (EQA shead 5 B) SUCCESS (IF (EQA shead 5 A) CALL F5 [stail 6] CALL F1 [stail 6] FAILURE) Fig. 10. KMP like residual program for the pattern AAB. 7 Related Work The principles of driving were first formulated in the early seventies by Turchin [20,21] and further developed in the eighties [22,24] From its very inception, supercompilation has been tied to a specific programming language, called Refal [24] Applications of supercom pilation include, among others, program specialization, program inversion and theorem proving. Other related ....

Turchin V. F., Equivalent transformations of recursive functions defined in Refal. In: Teoria Jazykov i Metody Programmirovanija (Proceedings of the Symposium on the Theory of Languages and Programming Methods) . (Kiev-Alushta, USSR). 31-42, 1972 (in Russian).

....functional languages to capture the implications of Horn clauses and use goal solving for logic variables. alternatively, conditional systems provide a natural bridge between functional programming, based on equational semantics, and logicprogramming, based on Horn clauses. See [35] Narrowing [36, 37] is a linear restriction of paramodulation akin to the SLD strategy in Horn clause logic [2] Whereas paramodulation uses both sides of an equation in the same way, narrowing is more directed unifying with left hand sides only thereby taking the direction of rewriting into account. In the ....

V. F. Turchin. Equivalent transformation of recursive functions defined in the language Refal. In Sympos Teoria Yazykov i Metody Prostroenia System Programirowania, pages 31--42. Alushta-Kiev, 1972. in Russian.

....P may be formulated as an algorithm checking the linguistic object x. The inversion of programs is a fundamental problem, and a large branch of computer science has been based on solutions emerging from logic and proof theory [3,4] Direct methods for inverting algorithms have been developed [5 7]. By varying the metaevaluator Mc and the method for solving the inverse problem different linguistic models can be generated by MST formulas involving composition and inversion. 3.3 Problem of Program Specialization Automatic inversion by metacomputation is a hard problem, and hence it is ....

V. F. Turchin, "Equivalent transformations of recursive functions defined in Refal", Teorija Jazykov i Metody Programmirovanija (Proceedings of the Symposium on the Theory of Languages and Programming Methods), 31-42, (1972), in Russian.

No context found.

Turchin, V.F., Equivalent transformations of recursive functions defined in Refal. In: Teoriya Yazykov I Metody Postroeniya Sistem Program19 mirovaniya (Proceedings of the Symposium), Kiev-Alushta (USSR), pp.31-42, 1972 (in Russian).

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