Efficient Graph Rewriting and Its Implementation

D?rr Heiko

ISBN 10: 3540600558 ISBN 13: 9783540600558

Editorial: Springer, 1995

Idioma: Ingl�s

Condici�n: Nuevo Encuadernaci�n de tapa blanda

Guardar para m�s tarde

Vendido por Majestic Books, Hounslow, Reino Unido

Vendedor de AbeBooks desde 19 de enero de 2007

Calificaci�n del vendedor: 5 de 5 estrellas

Ver los art�culos de este vendedor

Ver todos los ejemplares de este libro

Nuevos - Encuadernaci�n de tapa blanda

Condici�n: Nuevo

Precio: EUR 45,97 Convertir moneda

EUR 10,22 gastos de env�o desde Reino Unido a Espa�a Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Guardar para m�s tarde

Descripci�n

pp. 288 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

N� de ref. del art�culo 5861243

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Efficient Graph Rewriting and Its Implementation
Editor: Springer
Fecha de publicaci�n: 1995
Idioma: Ingl�s
ISBN 10: 3540600558
ISBN 13: 9783540600558
Encuadernaci�n: Encuadernaci�n de tapa blanda
Estado: New

Acerca de

Sinopsis

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.

Rese�a del editor

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.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

We specialise in General Interest Books from South Asian countries.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

BOOKS AND PERIODICALS AGENCY LTD
90 Barnet Gate Lane, Barnet, EN5 2AX, United Kingdom

Condiciones de venta y env�o

Condiciones de venta

Returns accepted if you are not satisfied with the Service or Book.

Condiciones de env�o

Best packaging and fast delivery

M�todos de pago

A�adir una petici�n