Efficient Graph Rewriting and Its Implementation / edited by Heiko Dörr.
Contributor(s): Dörr, HeikoMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 922.Publisher: Berlin, Heidelberg : Springer-Verlag, 1995Description: 1 online resource : v.: digitalContent type: text Media type: computer Carrier type: online resourceISBN: 9783540494195; 3540494197; 3540600558; 9783540600558; 0387600558; 9780387600550Subject(s): Computer science | Software engineering | Computer science | Software engineering | Algebra | Mathematics | Physical Sciences & MathematicsGenre/Form: Electronic books. Additional physical formats: Printed edition:: No titleDDC classification: 005.13/1 LOC classification: QA267Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
This book presents two major research results on the fast implementation of graph rewriting systems (GRS). First, it explores the class of so-called UBS-GRS, where the complexity of a rewriting step is linear instead of NP, showing for example that visual programming is possible by UBS graph rewriting. Second, an abstract machine for graph rewriting is defined providing an instruction set sufficient for the execution of GRS. The basic definitions of GRS in the algorithmic approach are introduced and extended by attribution and control structures to comprise a formalism for an operational specification. The translation of a functional programming language to graph rewriting shows the capabilities of UBS-GRS.
Graph rewriting systems -- The basic concepts -- UBS-Graph rewriting systems -- matching subgraphs in constant time -- Programmed attributed graph rewrite systems -- An advanced modelling formalism -- The abstract machine for graph rewriting -- supporting a fast implementation -- A graphical implementation of functional languages -- a case study in UBS-graph rewriting systems -- Conclusions.
Includes bibliographical references and index.