Functional programming and parallel graph rewriting(free web version)

M. R. Sleep, M. J. Plasmeijer0471935670

Charting the progress of the theory, implementation and applications of rewriting models of computation, this study represents a key resource for researchers. A major feature of the book is the presentation of theoretical advances such as a new theory of transfinite term rewriting, a single pushout categorical model of graph rewriting and an abstract interpretation for term graph rewriting.

---

Table of contents :
Contents……Page 1
Preface……Page 2
1 Basic concepts……Page 17
2 Advanced concepts: Miranda……Page 52
3 The lambda-calculus……Page 92
4 Term rewriting systems……Page 127
5 Graph rewriting systems……Page 160
6 Type assignment systems……Page 197
7 Strictness analysis……Page 231
8 Clean – draft chapter……Page 263
8 Clean……Page 302
9 Translating Miranda to Clean……Page 349
10 Abstract ABC machine……Page 369
11 Translating Clean into ABC code……Page 390
12 Realizing the ABC machine……Page 414
13 Concurrency: Basic language concepts……Page 450
14 Parallel graph rewriting……Page 476
15 Concurrent Clean……Page 496
16 The parallel ABC machine……Page 508
17 Realizing the PABC machine……Page 528
A Syntax of example programs……Page 548
B Concurrent Clean syntax and library……Page 552
C ABC machine specification……Page 576
D PABC machine specification……Page 589
Bibliography……Page 601
Index……Page 610
Errata, 2001……Page 619