| 000 | 00801camuuu200241 a 4500 | |
| 001 | 000000922317 | |
| 005 | 19990121094359.0 | |
| 008 | 950601s1995 nyu 001 0 engx | |
| 010 | ▼a 95030326 | |
| 020 | ▼a 3540600558 (alk. paper) | |
| 020 | ▼a 0387600558 (U.S. : alk. paper) | |
| 040 | ▼a DLC ▼c DLC ▼d DLC ▼d 244002 | |
| 049 | 0 | ▼l 151033036 |
| 050 | 0 0 | ▼a QA267 ▼b .D67 1995 |
| 082 | 0 0 | ▼a 005.13/1 ▼2 20 |
| 090 | ▼a 005.131 ▼b D652e | |
| 100 | 1 | ▼a Dorr, Heiko, ▼d 1962- |
| 245 | 1 0 | ▼a Efficient graph rewriting and its implementation / ▼c Heiko Dorr. |
| 260 | ▼a New York, N.Y. : ▼b Springer-Verlag, ▼c 1995. | |
| 300 | ▼a ix, 266 p. ; ▼c 23 cm. | |
| 440 | 0 | ▼a Lecture notes in computer science ; ▼v . 922. |
| 504 | ▼a Includes bibliographical references(p.255-259) and index. | |
| 650 | 0 | ▼a Rewriting systems (Computer science). |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 세종학술정보원/과학기술실(5층)/ | 청구기호 005.131 D652e | 등록번호 151033036 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
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.
정보제공 :