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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!