) Huet G. and Levy J., "Computations in Orthogonal Rewriting Systems, Part I + II," in Computational Logic---Essays in Honor of Alan Robinson (J. Lassez and G. Plotkin, eds.), pp. 395--443, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....sense were responsible for its creation Trying to capture how intermediate and final terms originate from the initial term is formalized in a notion called origin tracking [4, 5, 10] Origin tracking is based on so called residuals . Residuals have been used successfully in more theoretical work [15, 21, 23], for reasoning about optimal reduction strategies in TRSs. Figure 1: Example of a generated environment using origin tracking. 1.1 Applications Our motivation for working on origin tracking is its applicability to the automatic generation of tools from algebraic specifications of programming ....

....interpreter to the source program (given a specification of an evaluator) thereby aiding the generation of program animators [25] 1. 2 Preliminaries: First Order Rewriting Before defining origins more rigorously, we borrow some preliminary definitions concerning first order term rewriting from [19, 15]. Given an alphabet containing variables and function symbols each equipped with an arity (a natural number) a set of terms is constructed by considering ffl all variables as terms. ffl f(t 1 ; t n ) is a term when t 1 ; t n (n 0) are terms and f is an n ary function symbol. A term ....

[Article contains additional citation context not shown here]

G. Huet and J.-J. L'evy. Computations in orthogonal rewriting systems part I and II. In J.-L. Lassez and G. Plotkin, editors, Computational Logic; essays in honour of Alan Robinson, pages 395--443. MIT Press, 1991.

....not rely on properties of built in algebraic datatypes such as lists or trees. In [BM92] some of the techniques in [Bur91] are formulated in the context of continuation passing transformations. Another approach to obtain better termination properties are the sequential strategies investigated by [HL91, O D77] In this approach, only needed redexes are rewritten, i.e. redexes that would be rewritten in any reduction to a normal form. Unfortunately, neededness is only well defined in TRSs that do not have overlapping redexes. This restriction is hard to live with in practice. To our knowledge, ....

G. Huet and J.-J. L'evy. Computations in orthogonal rewriting systems part I and II. In J.-L. Lassez and G. Plotkin, editors, Computational Logic; essays in honour of Alan Robinson, pages 395--443. MIT Press, 1991.

....In particular, the patterns used to specify the animation behavior for Tip s animator become much simpler, and the adaptation of the abstract syntax proposed by Dinesh to improve his origins becomes unnecessary. On the theoretical side, origins are related to so called residuals or descendants [HL91, Mar91] which are used in the search for optimal reduction strategies. Currently, Field and Tip are extending residuals to creation residuation tracking using ideas from incremental rewriting as described by [Fie93] The notion of a program scheme [Cou90] is a general device to understand ....

....u ffl u Delta v 0 ffl u Delta v 0 Delta w v OE u v j u v j u Delta v 0 Delta w Figure 2: Relative positions of v with respect to contractum position u 3. 1 Preliminaries Before defining origins, we borrow some preliminary definitions concerning first order term rewriting from [Klo92, HL91] A term t can be reduced to a term t 0 according to a rewrite rule r : ff fi by identifying a context C[ and subterm s in t such that t j C[s] and by finding a substitution oe such that s j ff oe . Then t j C[ff oe ] rewrites to C[fi oe ] j t 0 by one elementary reduction, written ....

[Article contains additional citation context not shown here]

G. Huet and J.-J. L'evy. Computations in orthogonal rewriting systems part I and II. In J.-L. Lassez and G. Plotkin, editors, Computational Logic; essays in honour of Alan Robinson, pages 395--443. MIT Press, 1991.

.... for its the creation Trying to capture how intermediate and final terms originate from the initial term is formalized in a notion called origin tracking [Ber91, Ber92, DKT93] Origin tracking is based on so called residuals, which have been used successfully in more theoretically oriented papers [HL91, Mar91] for reasoning about optimal reduction strategies in TRSs. 1.1 Applications Our motivation to work on origin tracking was that we needed it for the automatic generation of tools from algebraic specifications of programming languages. As an example, Supported by the European ....

....0 Delta w v OE u v j u v j u Delta v 0 Delta w Figure 2: Relative positions of v with respect to contractum position u 1. 2 Preliminaries: First Order Rewriting Before defining origins more rigorously, we borrow some preliminary definitions concerning first order term rewriting from [Klo91, HL91] Given an alphabet containing variables and function symbols each equipped with an arity (natural number) a set of terms is constructed: all variables are terms, and if f is an n ary function symbol and t 1 ; t n (n 0) are terms, then f(t 1 ; t n ) is a term. A term t can be ....

[Article contains additional citation context not shown here]

G. Huet and J.-J. L'evy. Computations in orthogonal rewriting systems part I and II. In J.-L. Lassez and G. Plotkin, editors, Computational Logic; essays in honour of Alan Robinson, pages 395--443. MIT Press, 1991.

No context found.

) Huet G. and Levy J., "Computations in Orthogonal Rewriting Systems, Part I + II," in Computational Logic---Essays in Honor of Alan Robinson (J. Lassez and G. Plotkin, eds.), pp. 395--443, 1992.

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