M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term graph rewriting. John Wiley & Sons Ltd., Chichester, 1993. Theory and practice.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and shows the incompleteness of the dual relation of collapsing narrowing, namely copying narrowing. For a better readability of the paper, some proofs and de nitions have been moved to the appendix. 2 Preliminaries Many di erent notations are used in the literature to investigate graphs (see [11, 22] for a compilation) The aim of this section is to give brie y some key de nitions in order to make easier the understanding of the paper. Our notations are similar to those of [7, 16] We are consistent with [9, 8] A many sorted signature = hS; i consists of a set S of sorts and an S indexed ....

M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term Graph Rewriting. Theory and Practice. J. Wiley & Sons, Chichester, UK, 1993.

....etc. These transformations can be said to be based on term rewritings, replacements of (sub)expressions. The proofs of the correctness of transformations on graphs which are based on these term rewritings need to be trivial consequences of the correctness of term rewriting rules. It is shown in [Sleep93] that term rewriting can be embedded in graph rewriting by term graph rewriting. The here presented research is part of a project that is aimed to show the feasibility of transformational design. The transformational design system TRADES [Middelhoek95] developed in this project is based on the ....

M.R. Sleep, M.J. Plasmeijer and M.C.J.D. van Eekelen, Term Graph Rewriting, John Wiley& Sons Ltd, 1993.

....rewriting strategy by using Antoy s definitional trees. We show that the resulting strategy computes only needed redexes and develops optimal derivations w.r.t. the number of steps. 1 Introduction Graph rewriting is being investigated in various areas nowadays (see for instance [Cou93, ET96, SPvE93] In this paper, we consider graph rewriting as the underlying operational semantics of rule based (functional or logic) programming languages (e.g. PvE93, AEH 96] There are many reasons that motivate the use of graphs. They actually allow sharing of subexpressions which leads to ....

M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term Graph Rewriting. Theory and Practice. J. Wiley & Sons, Chichester, UK, 1993. 34

....efficient implementations of functional languages often represent expressions as directed acyclic graphs rather than as trees, so that at the implementation level the rewriting taking place is graph rewriting. This case is usually called term graph rewriting and has been studied extensively (see [97] for a representative collection of papers) However, graph rewriting is a very general model and can express many other computations besides functional ones. The theory of graph grammars and graph transformations (see [33, 94] for recent conferences) considers graph rewriting in this more general ....

M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. vanEekelen, editors. Term Graph Rewriting. Wiley, 1993.

....translations in parsed trees [AU72, AU73] Translations are defined with the use of paired grammar productions and made production by production. Transformations one structure after another can be implemented by tree transducers [Rou70, Tha73, Bak78b, GS84, NP92] by term rewriting systems [Klo92, SPvE93] and by methods and languages based on a tree pattern matching and replacement [KPPM84, HO82, SF83, Kil92, KM93, CCB95, NBY95, BCD 95, JK95] The user will define the transformation and the method will direct the transformation according the definitions. In manual methods like tree editors ....

....into numbered modules and a module with number i may call modules with numbers not less than i. A modular tree transducer, as an generalization of a macro tree transducer, allows also to specify operations on trees in a modular way. Definition 6.6. A term rewriting system [Klo92, Rao93, SPvE93] is a pair R = Sigma; P) where Sigma is a finite ranked alphabet of function symbols and P is a set of rewrite rules over a set of terms T Sigma ( Xi) of the form t t 0 where t and t 0 are terms called an input pattern and an output pattern, respectively, so that the input pattern t is ....

M.R. Sleep, M.J. Plasmeijer, and M.C.J.D. van Eekelen, editors. Term Graph Rewriting, Theory and Practice. Wiley & Sons, Chichester, UK, 1993.

.... programming, rewriting, semantic based optimization, compiler generation 1 Introduction In this paper we introduce Prop, an extension of C [Str91, that includes string matching, algebraic datatypes, Standard ML style pattern matching[HMM86, RMH90, pretty printing, tree rewriting[SPvE93], DATALOG style inference[ constraint logic programming[ and simple persistence as built in features. Prop is designed as a development language for interpreters, compilers, and language translation and transformation tools[ASU86, It simplifies the construction of these systems by ....

M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term Graph Rewriting. Theory and Practice. John Wiley & Sons, 1993.

..... A TGRS can be regarded as a TRS with addresses i.e. a variable in a rule of a TRS is regarded as an address in a TGRS. Thus, subterms will be shared in each reduction step of a TGRS, whereas each reduction step of a TRS simply copies. Theoretical basis for a TGRS has been extensively worked [MSvE94] but the most works have been devoted to a acyclic TGRS. For a cyclic TGRS which can simulate infinite reductions on infinite terms, only few works have been started [AK94, SdV94, Blo95] This paper investigates a new termination criteria simple gap termination for a cyclic TGRS. First, we prove ....

M.J.Plasmeijer M.R. Sleep and M.C.J.D. van Eekelen, editors. Term Graph Rewriting, Theory and Practice. Wiley, 1994.

....specification of database systems, specification of abstract data types, specification of distributed systems, etc. This development is documented in proceedings and other collections of selected papers, in some monographs as well as in a handbook [CER79, ENR83, ENRR87, EKR91, Hab92, PvE93, SPvE93, SE94, CM95, CEER96, Roz97] This paper surveys some recent developments in applying graph transformation to the specification and development of systems, languages, and tools. Section 2 recalls the basic concepts of a fairly general approach to graph transformation, and points out possible ....

M. Ronan Sleep, Rinus Plasmeijer, and Marko van Eekelen, editors. Term Graph Rewriting, Theory and Practice. Wiley & Sons, Chichester, 1993.

....compiler description, database systems, specification of abstract data types, specification of distributed systems, etc. This development is documented in proceedings and other collections of selected papers as well as on some monographs ( CER79, CM95, EKR91, ENR83, ENRR87, Hab92, PvE93, SE94, SPvE93] The aim of this survey paper is to point out some recent trends in applied graph transformation as a rule based framework for the specification and development of systems, languages, and tools. The central part of the paper (Section 3) describes four case studies that demonstrate the usefulness ....

....to avoid multiple representations of the same subexpressions. This leads to the idea of term graph rewriting that is also known as jungle evaluation or graph reduction and represents one of the oldest and most successful applications of graph transformation (cf eg [BvEG 87, CR93, HP91, Plu93b, SPvE93, Wad71] 2. The Agg system is a graphical tool for editing graphs and transforming them by graph transformation rules. Parts of the Agg system have been specified by graph transformation to exemplify the use of graph transformation concepts in the development of CASE tools and similar systems. ....

M.R. Sleep, M.J. Plasmeijer, M. van Eekelen, eds. Term Graph Rewriting, Theory and Practice. Wiley & Sons, Chichester, New York, Brisbane, Toronto, Singapore, 1993.

....languages, specification of database systems, specification of abstract data types, specification of distributed systems, etc. This development is documented in proceedings and other collections of selected papers as well as in some monographs [CER79, ENR83, ENRR87, EKR91, Hab92, PvE93, SPvE93, SE94, CM95, CEER96] This paper surveys some recent developments in applying graph transformation to the specification and development of systems, languages, and tools. Section 2 recalls the basic concepts of a fairly general approach to graph transformation, and points out possible variations ....

M. Ronan Sleep, Rinus Plasmeijer, and Marko van Eekelen, editors. Term Graph Rewriting, Theory and Practice. Wiley & Sons, Chichester, 1993.

No context found.

M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term graph rewriting. John Wiley & Sons Ltd., Chichester, 1993. Theory and practice.

No context found.

M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term graph rewriting. John Wiley & Sons Ltd., Chichester, 1993. Theory and practice.

No context found.

Ronan Sleep, Rinus Plasmeijer, and Marko van Eekelen, editors. Term Graph Rewriting. Theory and Practice, Chichester, 1993. John Wiley.

No context found.

Sleep, R., R. Plasmeijer and M. v. Eekelen, editors, \Term Graph Rewriting. Theory and Practice," John Wiley, Chichester, 1993. 12

No context found.

Rinus Plasmeijer,and Ronan Sleep. Term graph rewriting. In Proceedings of Parallel Architectures and Languages Europe,pages 141#158. Springer-Verlag, LNCS259, 1987.

No context found.

M.J., and Sleep, M.R. 1987. Term Graph Rewriting. In Bakker, J.W. de, Nijman, A.J., and Treleaven, P.C. eds. Proceedings of Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, LNCS 259, Vol.II. Springer-Verlag, Berlin, pp. 141-158.

No context found.

M.J., Sleep M.R. (1987), 'Term Graph Rewriting, Proceedings of Parallel Architectures and Languages Europe (PARLE), part II, Eindhoven, The Netherlands, LNCS Vol. 259, pp. 141-158, June 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