E-Book Overview
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.
E-Book Content
Functional Programming and Parallel Graph Rewriting Functional Programming and Parallel Graph Rewriting is a book written by Rinus Plasmeijer and Marko van Eekelen. It was published in 1993.
Preface Part 1 FUNCTIONAL PROGRAMMING 1 Basic concepts 2 Advanced concepts: Miranda
Part 2 MODELS OF COMPUTATION 3 The l-calculus 4 Term rewriting systems 5 Graph rewriting systems
Part 3 ANALYSIS OF FUNCTIONAL PROGRAMS 6 Type assignment systems 7 Strictness analysis
Part 4 IMPLEMENTATION ON SEQUENTIAL ARCHITECTURES 8 Clean 9 Translation into Clean 10 The abstract ABC machine 11 Translating Clean into ABC code 12 Realizing the ABC machine
Part 5 CONCURRENCY ISSUES 13 Basic language concepts 14 Parallel graph rewriting 15 Concurrent Clean 16 The Parallel ABC Machine 17 Realizing the PABC machine
APPENDICES A Syntax of the example programs B Concurrent Clean syntax and library C ABC machine specification D PABC machine specification Bibliography Index
Functional Programming and Parallel Graph Rewriting
Rinus Plasmeijer Marko van Eekelen
Preface
Functional languages
In a declarative programming language a computation is expressed in a static fashion, as a list of declarations. A program in such a language is regarded as a specification that happens to be executable as well. In this textbook we focus on a subclass of the declarative languages, the functional programming languages, sometimes