Turchin, V.F. Refal-5, Programming Guide and Reference Manual. New England Publishing Co., Holyoke, Massachusetts, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....C language. Self Application. Two methods have been used for improving the performance of self application: actions trees [CD90] an off line method that compiles the information obtained by the binding time analysis into directives for the partial evaluator, and the freezer (metasystem jumps) [Tur89] in supercompilation, an on line method that allows the evaluation of partially known expressions by the underlying implementation. Both methods are less effective for multiple partial evaluation than the multi cogen approach because (i) they do not avoid the transformation of dynamic ....

Valentin F. Turchin. Refal-5, Programming Guide and Reference Manual. New England Publishing Co., Holyoke, Massachusetts, 1989.

.... ftree1g ftree2g) f(LET name exp tree)g = CONS (ATOM LET) CONS (ATOM name) CONS fexpg ftreeg) f(CONS exp 1 exp 2 )g = CONS (ATOM CONS) CONS fexp 1 g fexp 2 g) f(ATOM atom)g = CONS (ATOM ATOM) ATOM atom) Fig. 4. S Graph metacoding (excerpts) Turchin s freezer mechanism [24] facilitates a dramatic optimization in run time during multiple self applications [17] However, it remains to extend and systematically clarify similar techniques in the context of multi level hierarchies. Our goal is to lay the foundation for a multi level metaprogramming environment that fully ....

Valentin F. Turchin. Refal-5, Programming Guide and Reference Manual. New England Publishing Co., Holyoke, Massachusetts, 1989.

....has been tied to a specific programming language, called Refal [78] a language inspired by Markov algorithms. A Refal program is a sequence of rewrite rules, used to transform data in the form of associative and possibly nested symbol strings and offers certain advantages for programming, e.g. [90, 62]. Running interpreters were available by the end of the 1960 s [22] different versions of the language were implemented [96, 50, 90, 40] Driving and generalization for our language are simplified considerably due to simpler data structures, untyped variables, and flat patterns (essentially ....

.... is a sequence of rewrite rules, used to transform data in the form of associative and possibly nested symbol strings and offers certain advantages for programming, e.g. 90, 62] Running interpreters were available by the end of the 1960 s [22] different versions of the language were implemented [96, 50, 90, 40]. Driving and generalization for our language are simplified considerably due to simpler data structures, untyped variables, and flat patterns (essentially elementary contractions [89] Due to Refal s data structure most general unifiers do not always exist; a generalized matching algorithm is ....

V.F. Turchin. Refal-5, Programming Guide and Reference Manual. New England Publishing Co., Holyoke, Massachusetts, 1989.

.... a la Martin Lof) Yet another promising recent development in this general area is the use of lambda calculi and monads a la Moggi [39] to give semantics to reflective languages [11, 33] 3.1. 2 Equational Languages There is very strong evidence, thanks to the work on the Refal supercompiler [56, 57, 59] and to related work on partial evaluation of equational programs [6, 49] suggesting that equational languages can be made reflective in our precise axiomatic sense. The careful representation by levels of Refal terms and programs (also represented as terms) 59] has excellent mathematical ....

Valentin F. Turchin. REFAL-5, Programming Guide and Reference Manual. New England Publishing Co., 1989.

....transformation of programs using a principle which is similar to partial evaluation. In the present paper we use a supercompiler, which V.F. Turchin and we have described in [22] 23] The supercompiler ( Scp ) is the result of the ground breaking investigations by V.F. Turchin [17] 18] 19] [20]. The present version of Scp differs from the one presented before [22] 23] in one point. This point is a whistle and generalization. Whistle is a method to stop the unfolding looking for a possible cycle. Generalization is a method to find the most specific generalization of terms seen in the ....

....unfolding and instantiations, lazy evaluation, inverse evaluation. 2 Preliminaries 2.1 Object language Our setting is a fragment of Refal. We mean this fragment, whenever we say Refal. Refal: Refal is a first order functional language with an applicative order (inside out) semantics [17] [20]. Definition: 1) Data of Refal is the set of all finite sequences of object terms. The empty sequence belongs to Data. 2) An object term is a ( sequence of object terms ) or symbol . 3) A symbol is a number or character or symbolic name, which is not a variable. 4) An object expression ....

[Article contains additional citation context not shown here]

Turchin V., Refal-5, Programming Guide and Reference Manual, New England Publishing Co., 1989.

....text in strict Refal is automatically converted into flat Refal: first in the sentential form (for debugging) and then, finally, in the graph form, in which it becomes an object program for the higher level supercompiler. Definition of basic, strict and extended Refal can be found in [11] 13] [14]. A brief description of flat Refal follows. The syntax of flat Refal is given in Table 1. The fundamental data structure of Refal, the expression, is more general than the list or s expression used in Lisp, Prolog, and many functional languages. It allows concatenation as one of the two basic ....

Turchin V., Refal-5, Programming Guide and Reference Manual, New England Publishing Co., 1989.

No context found.

Turchin, V.F. Refal-5, Programming Guide and Reference Manual. New England Publishing Co., Holyoke, Massachusetts, 1989.

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