|
|
|
|
| LEADER |
01602nam a2200301 a 4500 |
| 001 |
c000162645 |
| 003 |
CARM |
| 005 |
19960213000000.0 |
| 008 |
950601s1995 nyu 001 0 eng |
| 010 |
|
|
|a 95030326
|
| 019 |
1 |
|
|a 11761030
|5 LACONCORD2021
|
| 020 |
|
|
|a 0387600558
|b (U.S. : alk. paper)
|
| 020 |
|
|
|a 3540600558
|b (alk. paper)
|
| 035 |
|
|
|a (OCoLC)32698586
|5 LACONCORD2021
|
| 040 |
|
|
|a TOC
|b eng
|c TOC
|d TOC
|
| 050 |
|
0 |
|a QA267
|b .D67 1995
|
| 082 |
0 |
0 |
|a 005.13/1
|2 20
|
| 100 |
1 |
|
|a Dörr, Heiko,
|d 1962-
|
| 245 |
1 |
0 |
|a Efficient graph rewriting and its implementation /
|c Heiko Dörr.
|
| 260 |
|
|
|a New York, N.Y. :
|b Springer-Verlag,
|c c1995.
|
| 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.
|
| 505 |
0 |
|
|a 1. Introduction -- 2. Graph Rewriting Systems - The Basic Concepts -- 3. UBS-Graph Rewriting Systems - Matching Subgraphs in Constant Time -- 4. Programmed Attributed Graph Rewrite Systems - An Advanced Modelling Formalism -- 5. The Abstract Machine for Graph Rewriting - Supporting a Fast Implementation -- 6. A Graphical Implementation of Functional Languages - A Case Study in UBS-Graph Rewriting Systems -- 7. Conclusions -- Appendix B: Implementation of a Functional Program.
|
| 650 |
|
0 |
|a Rewriting systems (Computer science)
|
| 852 |
8 |
|
|b CARM
|h A2:AM07F0
|i C05502
|p 0214723
|f BK
|
| 999 |
f |
f |
|i 6f35d7b2-99b6-5085-afc0-f41e37b9fc42
|s 0edc12a2-e92d-5f16-8188-21eb11a34443
|
| 952 |
f |
f |
|p Can circulate
|a CAVAL
|b CAVAL
|c CAVAL
|d CARM 1 Store
|e C05502
|f A2:AM07F0
|h Other scheme
|i book
|m 0214723
|