F. Lang, D. Dougherty, P. Lescanne, and K. H. Rose. Addressed term rewriting systems. Research Report RR  Home/Search   Document Details and Download   Summary   Related Articles

....implementation of functional languages [23, 21] which, by essence, forbids destructive updates. Moreover, our graphs are represented as special terms, called addressed terms, exploiting the idea of simultaneous rewriting, already mentioned in [18, 4] and slightly generalized in this paper (see [13]) The framework Obj a is much more than a simple calculus. One of the consequences of this abstraction is that Obj a allows to define many calculi. A specific calculus is therefore a combination of modules plus a suitable strategy. Hence, what makes our approach original are the ....

....create the new fresh addresses (if required) then replace all the subterms of U at address a with the obtained right hand side. 2. Replace some subterms by back pointers (a fold operation) or some back pointers by particular terms (an unfold operation) following some specific techniques (see [13]) so that the result is a vertically admissible term. 13 Instantiation h i[s] a dh i b e a b fresh (OI) Message Sending (M ( m) s] a (M [s] b ( m) a b fresh (CP) dOe b ( m a Sel a O; m; dOe b (SE) Sel a hO m = V i b ; m;U (V U) a (SU) Sel a ....

[Article contains additional citation context not shown here]

F. Lang, D. Dougherty, P. Lescanne, and K. H. Rose. Addressed term rewriting systems. Research Report RR

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