Efficient Graph Rewriting and Its Implementation [electronic resource] /

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.

Bibliographic Details

Main Authors:	Dörr, Heiko. editor., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1995
Subjects:	Computer science., Software engineering., Programming languages (Electronic computers)., Computers., Mathematical logic., Computer Science., Theory of Computation., Mathematical Logic and Formal Languages., Programming Languages, Compilers, Interpreters., Software Engineering.,
Online Access:	http://dx.doi.org/10.1007/BFb0031909
Tags:	Add Tag No Tags, Be the first to tag this record!