V.F. Turchin. Semantic definitions in Refal and automatic production of compilers. In N.D. Jones, editor, Semantics-Directed Compiler Generation, pages 441--474. Springer LNCS 94, 1980.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and the outside in strategy, in 1972 [80, 81] and the main results concerning selfapplication, metasystem transition, in 1973. The book [96] defined all three Futamura projections in terms of metasystem transition. In the English language, the work on supercompilation was first described in [83, 84, 85, 86] and then developed further in [87, 89, 93, 99] For 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 ....

....As a result, supercompilation may make programs terminate more often. Here supercompilation is used to transform programs with normal order graph reduction semantics into programs with the same semantics and the same termination properties. Process trees correspond to Turchin s graph of states [85] (sometimes called Refal graphs or pattern matching graphs [95] Driving was used in the seventies in a system for inverse computation, called URA (cf. 65] Sect. 5.2) an application that has been suggested earlier in [80] Neighborhood analysis [84] uses driving to determine sets of data that ....

V.F. Turchin. Semantic definitions in Refal and the automatic production of compilers. In N.D. Jones, editor, Workshop on Semantics-Directed Compiler Generation, Arhus, Denmark, volume 94 of LNCS, pp. 441--474. Springer-Verlag, 1980.

....with treeless definitions, a syntactic restriction on the terms defining functions. However, we will see that deforestation has valuable applications well beyond this original, intended scope by applying it to arbitrary definitions, see Sections 5.5 and 6.2. Supercompilation, conceived by Turchin (1979,1980,1986) in the early 1970 s in Russia for the language Refal, achieves the effects of both deforestation and partial evaluation, as well as some more dramatic optimizations. This is done by driving, i.e. unfolding and propagation of information, and generalization (Turchin, 1988) a form of ....

Turchin, V.F. 1980. Semantic definitions in Refal and automatic production of compilers.

....The next year, the report [Tur80a] gave the result of the whole project: description of Refal, the equivalence transformations, the theory of compilation and metasystem transition including the Futamura projections. Also in 1980, some papers describing material in parts of [Tur80a] were published: [Tur80b] on the theory of compilation and metasystem transition, and [Tur80c] on the supercompiler as a theorem prover. In 1982, experiments with an implementation of the supercompiler were reported by Turchin and co workers [Tur82] In 1986 three papers appeared: Tur86a] describing Refal and containing a ....

....transformation trees, and this folding scheme is identical to the one in W. Transformation trees and graphs are very similar to, and indeed inspired by, process trees and graphs, respectively, as described by Gluck and Klimov [Glu93a] which in turn stem from graphs of states in Turchin s papers [Tur80a,Tur80b]. 4.3. WALKS 31 4.3 Walks Remark 4.3.1 In this section we are concerned with M 1=2 terms and programs only. 2 In the two preceding sections we have introduced interpretation trees and transformation trees and graphs as computation histories for the intepreter and positive supercompiler, ....

[Article contains additional citation context not shown here]

V. F. Turchin. Semantic Definitions in Refal and Automatic Production of Compilers. In Semantics-Directed Compiler Generation, Aarhis, Denmark. (Ed.) Neil D. Jones, Lecture Notes in Computer Science vol. 94, pp. 645-657, 1980.

....another is infeasible. Each branching has several conditions which have to be tested. This is extra work. Thus infeasible branches intro duce additional tests and thereby degrade the efficiency of feasible walks. The more interpre tive an algorithm is, the less perfect its process graph [23]. Example. Consider the following fragment of a graph (or the program represented by it we will not distinguish here) The branches B and C are in fea sible, and the tests EQA 2 and EQA 3 are redundant. There exists no initial state which follows the branches B and C . IF (EQA 1 x ....

....language, called Refal [24] Applications of supercom pilation include, among others, program specialization, program inversion and theorem proving. Other related aspects have been investigated in [1,7,8,13,14,17,18,26] The notion of perfect process graphs and perfect driving were introduced in [22,23]. The language S Graph is closely related to Turchin s Refal graphs [25] But due to SGraph s simpler data structure, untyped variables and only two elementary contractions, one may build rather clear and concise driving algorithms. In particular, there is only one way to compose and decompose ....

Turchin V. F., Semantic definitions in Refal and automatic production of compilers. In: Jones N. D. (ed.), Semantics-Directed Compiler Generation. (Aarhus, Denmark). Lecture Notes in Computer Science, Vol. 94, 441-474, Springer-Verlag 1980.

.... intermediate data structure is a list, and indeed Wadler s deforestation algorithm which handles general data structures is a successor of his earlier work on a method of eliminating intermediate lists [Wad84] Wad85] Both of these techniques were inspired by the early pioneering work by Turchin [Tur80], Tur82] on the supercompiler, a program transformation technique which does both partial evaluation 2 and deforestation. We note here that the emphasis is on fully automatic methods. General fold unfold transformations similar to deforestation have been known for a long time [Bur77] Dar81] ....

Valentin F. Turchin. Semantic Definitions in Refal and Automatic Production of Compilers. In LNCS 94. 1980.

No context found.

V.F. Turchin. Semantic definitions in Refal and automatic production of compilers. In N.D. Jones, editor, Semantics-Directed Compiler Generation, pages 441--474. Springer LNCS 94, 1980.

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