K. Grue, Call-by-Mix: A Reduction Strategy for Pure -calculus, Unpublished note from DIKU (University of Copenhagen), 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Explicit Cyclic Substitutions - Rose (1993) (17 citations) (Correct)
....mutual recursion directly. However, it differs in that there is no implied underlying execution model: the description presented here is a pure, self contained rewriting system. The work described here has been inspired by the substitution pushing used by the Call by Mix strategy of Grue [11]. The current trend of optimal reduction also touches on sharing although only as a method to minimise the number of reductions [18, 17, 10, 19] In fact a lot of the work done within term graph rewriting [6] seems to be aiming at achieving the same results as we are: to provide a convenient yet ....
K. Grue, Call-by-Mix: A Reduction Strategy for Pure -calculus, Unpublished note from DIKU (University of Copenhagen), 1987.
Explicit Cyclic Substitution - Rose (1993) (17 citations) (Correct)
....CTRS and real functional programming languages clearer, and makes it possible to express and investigate properties of bindings, e.g. scoping rules, both in the simple and recursive case. The method of substitution pushing that we have chosen was inspired by the Call by Mix strategy of Grue [8]. The technique is closely related to and influenced by term graph rewriting [5, 19] The idea of using term graph rewriting in models of the calculus originates with Wadsworth [22] and has been investigated by several authors, notably Staples [21] We comment further on this in the conclusion. ....
K. Grue, "Call-by-Mix: A Reduction Strategy for Pure -calculus," Unpublished note from DIKU (University of Copenhagen), 1987.
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