Advertisement

About this book

Introduction

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.

Keywords

Attribut Efficient Implementation Effiziente Implementierung Functional Programming Funktionales Programmieren Graph Rewriting Systems Graphersetzungssysteme UBS Property UBS-Eigenschaft Visual Programming Visuelles Programmieren algorithms complexity

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0031909
  • Copyright Information Springer-Verlag Berlin Heidelberg 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60055-8
  • Online ISBN 978-3-540-49419-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site